Sciweavers

184
Voted
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
16 years 27 days ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
174
Voted
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
16 years 29 days ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...