Regret minimization and the price of total anarchy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 373-382

  Blum, Avrim ^a   Hajiaghayi, Mohammad Taghi ^b   Roth, Aaron ^a   Ligett, Katrina ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithmic game theory; Nash equilibria; Regret minimization

Indexed keywords

COMPUTATION THEORY;

ALGORITHMIC GAME THEORY; MIXED STRATEGY; NASH EQUILIBRIA; PRICE OF ANARCHY; REGRET MINIMIZATION; UNKNOWN BOUNDS; UPPER BOUND;

GAME THEORY;

EID: 57049137244     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374430     Document Type: Conference Paper

References (31)

1. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. STOC, pages 57-66, 2005.
2. B. Awerbuch and R. Kleinberg. Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In STOC, 2004.
3. M. Babaioff, R. Kleinberg, and C. H. Papadimitriou. Congestion games with malicious players. In EC, 2007.
4. X. Chen and X. Deng. Settling the complexity of 2-player nash-equilibrium. In FOCS, 2006.
5. S. Chien and A. Sinclair. Convergence to Approximate Nash Equilibria in Congestion Games. SODA, 2007.
6. G. Christodoulou and E. Koutsoupias. On the price of anarchy and stability of conelated equilibria of linear congestion games. ESA, pages 59-70, 2005.
7. G. Christodoulou and E. Koutsoupias. The price of anarchy of finite congestion games. STOC, pages 67-73, 2005.
8. A. Czumaj and B. Vocking. Tight bounds on worse case equilibria. In SODA, pages 413-120, 2002.
9. A. Czumaj and B. Vöcking. Tight bounds for worst-case equilibria. ACM Transactions on Algorithms, 3(1), 2007.
10. V. Dani and T. P. Hayes. Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary. In SODA, 2006.
11. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. On a network creation game. In PODC, pages 347-351, 2003.
12. D. P. Foster and R. V. Vohra. Calibrated learning and correlated equilibrium. Games and Economic Behavior, 1997.
13. J. J. Gabszewicz and J.-F. Thisse. Location. In R. Aumann and S. Hart, editors, Handbook of Game Theory with Economic Applications, volume 1, chapter 9. Elsevier Science Publishers (North-Holland), 1992.
14. M. Goemans, L. Li, V. Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad hoc networks. Selected Areas in Communications, IEEE Journal on, 24(5): 1020-1033, 2006.
15. M. Goemans, V. Mirrokni, and A. Vetta. Sink equilibria and convergence. In FOCS, pages 142-154, 2005.
16. J. Hannan. Approximation to Bayes risk in repeated play. In M. Dresher, A. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, volume III, pages 97-139. 1957.
17. S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 2000.
18. H. Hotelling. Stability in competition. The Economic Journal, 39(153):41-57, 1929.
19. S. Kakade, A. T. Kalai, and K. Ligett. Playing games with approximation algorithms. In STOC, 2007.
20. A. Kalai and S. Vempala. Efficient algorithms for on-line optimization. In COLT, pages 26-40, 2003.
21. M. Kilkenny and J. Thisse. Economics of Location: A Selective Survey. Computers and Operations Research, 26(14): 1369-1394, 1999.
22. R. Kleinberg. Anytime algorithms for multi-armed bandit problems. In SODA, pages 928-936, 2006.
23. E. Koutsoupias, M. Mavronikolas, and P. Spirakis. Approximate equilibria and ball fusion. Theory of Computing Systems, 36(6):683-693, 2003.
24. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In STAGS, pages 404-413, 1999.
25. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
26. H. McMahan and A. Blum. Online geometric optimization in the bandit setting against an adaptive adversary. In COLT, 2004.
27. V. S. Mirrokni and A. Vetta. Convergence issues in competitive games. In APPROX-RANDOM, 2004.
28. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
29. S. Suri, C. Toth, and Y. Zhou. Selfish Load Balancing and Atomic Congestion Games. Algorithmica, 47( l):79-96, 2007.
30. A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In FOCS, page 416, 2002.
31. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, pages 928-936, 2003.