International Workshop on Experimental and Efficient Algorithms

WEA 2005: Experimental and Efficient Algorithms pp 1-3

Παιδíα Παíζει The Interaction Between Algorithms and Game Theory

  • Christos H. Papadimitriou
Conference paper

DOI: 10.1007/11427186_1

Volume 3503 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Papadimitriou C.H. (2005) Παιδíα Παíζει The Interaction Between Algorithms and Game Theory. In: Nikoletseas S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg


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 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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Christos H. Papadimitriou
    • 1
  1. 1.UC Berkeley