On the inefficiency ratio of stable equilibria in congestion games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5929 LNCS, Issue , 2009, Pages 545-552

  Asadpour, Arash ^a   Saberi, Amin ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION GAMES; COORDINATING AGENTS; EXTREME CASE; GAME ENVIRONMENT; JOINT ACTIONS; LOAD-BALANCING; NONCOOPERATIVE GAME; POLYNOMIAL-TIME; POTENTIAL FUNCTION; PRICE OF ANARCHY; PRICE OF STABILITY; SOCIAL WELFARE; STABLE EQUILIBRIUM;

POLYNOMIAL APPROXIMATION; WINE;

INTERNET;

EID: 76649118490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10841-9_54     Document Type: Conference Paper

References (15)

1. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, É., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: FOCS 2004, pp. 295-304 (2004)
2. Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: STOC 2005, pp. 57-66 (2005)
3. Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: EC 2008, pp. 264-273 (2008)
4. Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: STOC 2008, pp. 373-338 (2008)
5. Blume, L.: The statistical mechanics of strategic interaction. Games and Economic Behavior 5, 387-426 (1993)
6. Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 311-322. Springer, Heidelberg (2006)
7. Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: SODA 2007, pp. 169-178 (2007)
8. Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: STOC 2005, pp. 67-73 (2005)
9. Chung, C., Ligett, K., Pruhs, K., Roth, A.: The Price of Stochastic Anarchy. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 303-314. Springer, Heidelberg (2008)
10. Ellison, G.: Learning, Local Interaction, and Coordination. Econometrica 61(5), 1047-1071 (1993)
11. Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT 19(3), 312-320 (1979)
12. Fudenberg, D., Kreps, D.: Learning Mixed Equilibria. Games and Economic Behavior 5, 320-367 (1993)
13. Fudenberg, D., Levine, D.K.: Theory of Learning in Games. MIT Press, Cambridge (1998)
14. Kleinberg, R., Piliouras, G., Tardos, É.: Multiplicative updates outperform generic no-regret learning in congestion games. In: STOC 2009, pp. 533-542 (2009)
15. Montanari, A., Saberi, A.: Convergence to Equilibrium in Local Interaction Games and Ising Models. In: FOCS 2009 (to appear, 2009)