Convergence to approximate Nash equilibria in congestion games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 169-178

  Chien, Steve ^a   Sinclair, Alistair ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GAME THEORY; POLYNOMIAL APPROXIMATION;

ARBITRARY DELAYS; CONGESTION GAMES; LOCAL DYNAMICS; NASH EQUILIBRIA; NONCOOPERATIVE GAME; POLYNOMIAL-TIME; RAPID CONVERGENCE; SHORTEST PATH;

TELECOMMUNICATION NETWORKS;

EID: 84969257793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. B. Awerbuch, Y. Azar and A. Epstein, "The price of routing unsplittable flow." Proc. 37th ACM Symposium on Theory of Computing, 2005, pp. 57-66.
2. M. Beckmann, C.B. McGuire and C.B. Winsten, Studies in the Economics of Transportation. Yale University Press, 1956.
3. A. Blum, E. Even-Dar and K. Ligett, "Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games." Proc. 25th ACM Symposium on Principles of Distributed Computing, 2006, pp. 45-52.
4. X. Chen and X. Deng, "Settling the Complexity of 2-Player Nash-Equilibrium." Proc. 47th IEEE Symposium on Foundations of Computer Science, 2006, to appear.
5. X. Chen, X. Deng and S.-H. Teng, "Computing Nash equilibria: Approximation and smoothed complexity." Proc. 47th IEEE Symposium on Foundations of Computer Science, 2006, to appear.
6. G. Christodoulou and E. Koutsoupias, "The price of anarchy of finite congestion games." Proc. 37th ACM Symposium on Theory of Computing, 2005, pp. 67-73.
7. C. Daskalakis, P.W. Goldberg and C.H. Papadimitriou, "The Complexity of Computing a Nash Equilibrium." Proc. 38th ACM Symposium on Theory of Computing, 2006, pp. 71-78.
8. E. Even-Dar, A. Kesselman and Y. Mansour, "Convergence time to Nash equilibria." Proc. 30th International Conference on Automata, Languages and Programming, 2003, pp. 502-513.
9. E. Even-Dar and Y. Mansour, "Fast convergence of selfish rerouting." Proc. 16th ACM-SIAM Symposium on Discrete Algorithm, 2005, pp. 772-781.
10. A. Fabrikant, C.H. Papadimitriou and K. Talwar, "The complexity of pure Nash equilibria." Proc. 36th ACM Symposium on Theory of Computing, 2004, pp. 604-612.
11. S. Fischer, H. Räcke and B. Vöcking, "Fast convergence to Wardrop equilibria by adaptive sampling methods." Proc. 38th ACM Symposium on Theory of Computing, 2006, pp. 653-662.
12. M. Goemans, V. Mirrokni and A. Vetta, "Sink equilibria and convergence." Proc. 46th IEEE Symposium on Foundations of Computer Science, 2005, pp. 142-154.
13. P.W. Goldberg, "Bounds for the convergence rate of randomized local search in a multiplayer loadbalancing game." Proc. 25th ACM Symposium on Principles of Distributed Computing, 2004, pp. 131-140.
14. D.S. Johnson, C.H. Papadimitriou and M. Yannakakis, "How easy is local search?" Journal of Computer and System Sciences 37 (1988), pp. 79-100.
15. M. Kearns and Y. Mansour, "Efficient Nash computation in large population games with bounded influence." Proc. 18th Conference in Uncertainty in Artificial Intelligence, 2002, pp. 259-266.
16. R.J. Lipton, E. Markakis and A. Mehta, "Playing large games using simple strategies." Proc. 4th ACM Conference on Electronic Commerce, 2003, pp. 36-41.
17. I. Milchtaich, "Congestion games with player-specific payoff functions," Games and Economic Behavior 13 (1996), pp. 111-124.
18. V.S. Mirrokni and A. Vetta, "Convergence issues in competitive games." Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2004, pp. 183-194.
19. D. Monderer and L.S. Shapley, "Potential games." Games and Economic Behavior 14 (1996), pp. 124-143.
20. J.F. Nash, "Equilibrium points in n-person games." Proc. National Academy of Sciences 36 (1950), pp. 48-49.
21. J. Orlin, A. Punnen, and A. Schulz, "Approximate local search in combinatorial optimization." Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 587-596.
22. C.H. Papadimitriou, "Algorithms, games and the Internet." Proc. 33rd ACM Symposium on Theory of Computing, 2001, pp. 749-753.
23. R.W. Rosenthal, "A class of games possessing purestrategy Nash equilibria." International Journal of Game Theory 2 (1973), pp. 65-67.
24. T. Roughgarden, Selfish routing and the price of anarchy. MIT Press, 2005.
25. T. Roughgarden and E. Tardos, "Bounding the inefficiency of equilibria in nonatomic congestion games." Games and Economic Behavior 47 (2004), pp. 389-403.
26. A.A. Schäffer and M. Yannakakis, "Simple local search problems that are hard to solve." SIAM Journal on Computing 20 (1991), pp. 56-87.
27. A. Vetta, "Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions." Proc. 43rd IEEE Symposium on Foundations of Computer Science, 2002, pp. 416-425.