• Publications
  • Influence
Randomized rumor spreading
TLDR
We investigate the class of epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. Expand
  • 733
  • 79
  • PDF
Approximation techniques for utilitarian mechanism design
TLDR
This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multi-parameter agents. Expand
  • 190
  • 24
  • PDF
Tight bounds for worst-case equilibria
TLDR
The coordination ratio is a game theoretic measure that aims to reflect the price of selfish routing in a network. Expand
  • 271
  • 21
  • PDF
Tight bounds for worst-case equilibria
  • 114
  • 18
On the Impact of Combinatorial Structure on Congestion Games
TLDR
We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. Expand
  • 87
  • 18
Balanced allocations: the heavily loaded case
TLDR
We investigate load balancing processes based on the multiplechoice paradigm. Expand
  • 184
  • 15
  • PDF
Distributed Contention Resolution in Wireless Networks
TLDR
We present and analyze simple distributed contention resolution protocols for wireless networks. Expand
  • 120
  • 15
  • PDF
Fast convergence to Wardrop equilibria by adaptive sampling methods
TLDR
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Expand
  • 126
  • 14
  • PDF
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
TLDR
2-Opt is probably the most basic local search heuristic for the TSP. Expand
  • 139
  • 12
  • PDF
Random knapsack in expected polynomial time
TLDR
We prove, for various input distributions, that the number of dominating solutions (i.e., Pareto-optimal knapsack fillings) to this problem is polynomially bounded in number of available items. Expand
  • 118
  • 12
  • PDF
...
1
2
3
4
5
...