The local and global price of anarchy of graphical games

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

Volumn 4997 LNCS, Issue , 2008, Pages 255-266

  Ben Zwi, Oren ^a   Ronen, Amir ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Graphical games; Local global properties; Price of anarchy

Indexed keywords

ANIMATION; GAME THEORY; OPERATING COSTS;

GRAPHICAL GAMES; LOCAL GLOBAL PROPERTIES; PRICE OF ANARCHY;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 44449103176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79309-0_23     Document Type: Conference Paper

References (15)

1. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: The 45th Annual IEEE Symposium on Foundations of Computer Science (FoCS), pp. 59-73 (2004)
2. Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: The 37th Annual ACM Symposium on Theory of Computing (SToC) (2005)
3. Awerbuch, B., Peleg, D.: Sparse Partitions. In: The 31st Annual IEEE Symposium on Foundations of Computer Science (FoCS), pp. 503-513 (1990)
4. Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium. In: The 47th Annual IEEE Symposium on Foundations of Computer Science (FoCS) (2006)
5. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.: The Complexity of Computing a Nash Equilibrium. In: The 38th Annual ACM Symposium on Theory of Computing (SToC) (2006)
6. th ACM conf. on Electronic Commerce (EC 2006) (2006)
7. Fischer, E.: The Art of Uninformed Decisions: A Primer to Property Testing. The Bulletin of the European Association for Theoretical Computer Science 75, 97-126 (2001)
8. Galeotti, A., Goyaly, S., Jackson, M.O., Vega-Redondox, F., Yariv, L.: Network Games (unpublished, 2006), http://www.stanford.edu/∼jacksonm/ networkgames.pdf
9. Kakade, S., Kearns, M., Ortiz, L., Pemantle, R., Suri, S.: Economic Properties of Social Networks. In: The 18th Annual Conference on Neural Information Processing Systems (NIPS) (2004)
10. Kearns, M., Littman, M., Singh, S.: Graphical Models for Game Theory. In: The 17th Conference in Uncertainty in Artificial Intelligence (UAI) (2001)
11. Koutsoupias, E., Papadimitriou, C.: Worst Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, Springer, Heidelberg (1999)
12. Linial, N., Peleg, D., Rabinovich, Y., Saks, M.: Sphere Packing and Local Majorities in Graphs. In: The 2nd Israel Symp. on Theory of Computing Systems (1993)
13. Linial, N., Saks, M.: Low Diameter Graph Decompositions. Combinatorica Issue Volume 13, 441-454 (1993)
14. Nash, J.F.: Non-Cooperative Games. Annals of Mathematics 54, 286-295 (1951)
15. Roughgarden, T., Tardos, E.: How Bad is Selfish Routing? In: The 41st Annual IEEE Symposium on Foundations of Computer Science (FoCS) (2000)