• Publications
  • Influence
Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications
TLDR
Pebble coordination problems and the diameter of permutation groups are obtained and some results in pebble coordination Problems are obtained.
An Optimization Approach for Approximate Nash Equilibria
TLDR
An efficient algorithm is provided that computes 0.3393- approximate equilibria, the best approximation till now, based on the formulation of an appropriate function of pairs of mixed strategies reflecting the maximum deviation of the players' payoffs from the best payoff each player could achieve given the strategy chosen by the other.
Weighted random sampling with a reservoir
TLDR
A new algorithm for drawing a weighted random sample of size m from a population of n weighted items, where m ≤ n, is presented and can generate a weightedrandom sample in one-pass over unknown populations.
The structure and complexity of Nash equilibria for a selfish routing game
TLDR
This work provides a comprehensive collection of efficient algorithms, hardness results (both as NP-hardness and #P-completeness results), and structural results for these algorithmic problems related to the computation of Nash equilibria for the selfish routing game the authors consider.
Space Efficient Hash Tables with Worst Case Constant Access Time
TLDR
This is the first dictionary that has worst case constant access time and expected constant update time, works with (1 + ε)n space, and supports satellite information.
BSP vs LogP
TLDR
Within the limits of the analysis that is mainly of asymptotic nature, BSP and LogP can be viewed as closely related variants within the bandwidth-latency framework for modeling parallel computation.
Selfish unsplittable flows
TLDR
It is proved that any weighted network congestion game with linear edge delays admits a pure Nash equilibrium that can be found in pseudo-polynomial time.
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture
TLDR
A strong upper bound is provided on the value of c*, showing that for c > 4.758 a random 3-SAT formula is unsatisfiable with high probability, based on a structural property, possibly of independent interest, whose proof needs several applications of the occupancy tail bounds.
Space Efficient Hash Tables with Worst Case Constant Access Time
TLDR
This is the first dictionary that has worst case constant access time and expected constant update time, works with (1+?) n space, and supports satellite information.
...
1
2
3
4
5
...