Tα Παιδíα Παíζει The Interaction Between Algorithms and Game Theory
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 , work on computing Nash and other equilibria [6,7], and reciprocal isolated works by algorithms researchers , as well as two important points of contact between the two fields à propos the issues of repeated games and bounded rationality  and learning in games . But the current intensive interaction and cross-fertilization 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.
Unable to display preview. Download preview PDF.
- 1.Fabrikant, A., Papadimitriou, C., Talwar, K.: The Complexity of Pure Nash equilibria. In: STOC (2004)Google Scholar
- 3.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)Google Scholar
- 5.Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (1999)Google Scholar
- 7.McKelvey, R., McLennan, A.: Computation of Equilibria in Finite Games. In: Amman, H., Kendrick, D.A., Rust, J. (eds.) The Handbook of Computation Economics, vol. I, pp. 87–142. Elsevier, Amsterdam (1996)Google Scholar
- 10.Papadimitriou, C.H.: Computing Correlated Equilibria in Multiplayer Games. In: STOC (2005)Google Scholar
- 12.Savani, R., von Stengel, B.: Long Lemke-Howson Paths. In: FOCS (2004)Google Scholar
- 14.Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)Google Scholar
- 15.Papadimitriou, C.H., Yannakakis, M.: On Complexity as Bounded Rationality (extended abstract). In: STOC, pp. 726–733 (1994)Google Scholar