Tα Παι δí α Παíζε ι The Interaction Between Algorithms and Game Theory
 Christos H. Papadimitriou
 … show all 1 hide
Abstract
The theories of algorithms and games were arguably born within a year of each other, in the wake of two quite distinct breakthroughs by John von Neumann, in the former case to investigate the great opportunities – as well as the ever mysterious obstacles – in attacking problems by computers, in the latter to model and study rational selfish behavior in the context of interaction, competition and cooperation. For more than half a century the two fields advanced as gloriously as they did separately. There was, of course, a tradition of computational considerations in equilibria initiated by Scarf [13], work on computing Nash and other equilibria [6,7], and reciprocal isolated works by algorithms researchers [8], as well as two important points of contact between the two fields à propos the issues of repeated games and bounded rationality [15] and learning in games [2]. But the current intensive interaction and crossfertilization between the two disciplines, and the creation of a solid and growing body of work at their interface, must be seen as a direct consequence of the Internet.
 Fabrikant, A., Papadimitriou, C., Talwar, K.: The Complexity of Pure Nash equilibria. In: STOC (2004)
 Fudenberg, D., Levine, D.K. (1998) Theory of Learning in Games. MIT Press, Cambridge
 Kearns, M., Littman, M., Singh, S.: Graphical Models for Game Theory. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 253–260 (2001)
 Koutsoupias, E., Papadimitriou, C.H. (1995) On the kServer Conjecture. JACM 42: pp. 971983 CrossRef
 Koutsoupias, E., Papadimitriou, C.H.: Worstcase Equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (1999)
 Lemke, C.E., Howson, J.T. (1964) Equilibrium Points of Bimatrix Games. Journal of the Society of Industrial and Applied Mathematics 12: pp. 413423 CrossRef
 McKelvey, R., McLennan, A. Computation of Equilibria in Finite Games. In: Amman, H., Kendrick, D.A., Rust, J. eds. (1996) The Handbook of Computation Economics. Elsevier, Amsterdam, pp. 87142
 Megiddo, N. (1978) Computational Complexity of the Game Theory Approach to Cost Allocation on a Tree. Mathematics of Operations Research 3: pp. 189196 CrossRef
 Nisan, N., Ronen, A. (2001) Algorithmic Mechanism Design. Games and Economic Behavior 35: pp. 166196 CrossRef
 Papadimitriou, C.H.: Computing Correlated Equilibria in Multiplayer Games. In: STOC (2005)
 Roughgarden, T., Tardos, Ã. (2002) How Bad is Selfish Routing?. JACM 49, 2: pp. 236259 CrossRef
 Savani, R., von Stengel, B.: Long LemkeHowson Paths. In: FOCS (2004)
 Scarf, H. (1973) The Computation of Economic Equilibria. Yale University Press, New Haven
 Vazirani, V.V. (2001) Approximation Algorithms. Springer, Heidelberg
 Papadimitriou, C.H., Yannakakis, M.: On Complexity as Bounded Rationality (extended abstract). In: STOC, pp. 726–733 (1994)
 Title
 Tα Παι δí α Παíζε ι The Interaction Between Algorithms and Game Theory
 Book Title
 Experimental and Efficient Algorithms
 Book Subtitle
 4th International Workshop, WEA 2005, Santorini Island, Greece, May 1013, 2005. Proceedings
 Pages
 pp 13
 Copyright
 2005
 DOI
 10.1007/11427186_1
 Print ISBN
 9783540259206
 Online ISBN
 9783540320784
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 3503
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Sotiris E. Nikoletseas ^{(16)}
 Editor Affiliations

 16. CTI and Univ. of Patras
 Authors

 Christos H. Papadimitriou ^{(17)}
 Author Affiliations

 17. UC Berkeley,
Continue reading...
To view the rest of this content please follow the download PDF link above.