Algorithmic Game Theory: Computational Evolutionary Game Theory

This chapter examines the intersection of evolutionary game theory and theoretical computer science. We will show how techniques from each field can be used to answer fundamental questions in the other. In addition, we will analyze a model that arises by combining ideas from both fields. First, we describe the classical model of evolutionary game theory and analyze the computational complexity of its central equilibrium concept. Doing so involves applying techniques from complexity theory to the problem of finding a game-theoretic equilibrium. Second, we show how agents using imitative dynamics, often considered in evolutionary game-theory, converge to an equilibrium in a routing game. This is an instance of an evolutionary game-theoretic concept providing an algorithm for finding an equilibrium. Third, we generalize the classical model of evolutionary game theory to a graph-theoretic setting. Finally, this chapter concludes with directions for future research. Taken as a whole, this chapter describes how the fields of theoretical computer science and evolutionary game theory can inform each other. 29.1 Evolutionary Game Theory Classical evolutionary game theory models organisms in a population interacting and competing for resources. The classical model assumes that the population is infinite. It models interaction by choosing two organisms uniformly at random, who then play a 2-player, symmetric game. The payoffs that these organisms earn represent an increase or a loss in fitness, which either helps or hinders the organisms ability to reproduce. In this model, when an organism reproduces, it does so by making an exact replica of itself, thus a child will adopt the same strategy as its parent. One of the fundamental goals of evolutionary game theory is to characterize which strategies are resilient to small mutant invasions. In the classical model of evolutionary game theory, a large fraction of the population, called the incumbents, all adopt the same strategy. The rest of the population, called the mutants, all adopt some other strategy. The incumbent strategy is considered to be stable if the incumbents retain a higher fitness than the mutants. Since the incumbents are more fit, they reproduce

[1]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[2]  K. Schlag Why Imitate, and If So, How?, : A Boundedly Rational Approach to Multi-armed Bandits , 1998 .

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

[4]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[5]  Paul G. Spirakis,et al.  Evolutionary Games: An Algorithmic View , 2005, Self-star Properties in Complex Information Systems.

[6]  D. E. Matthews Evolution and the Theory of Games , 1977 .

[7]  Josef Hofbauer,et al.  Evolutionary Games and Population Dynamics , 1998 .

[8]  Berthold Vöcking,et al.  On the Evolution of Selfish Routing , 2004, ESA.

[9]  Berthold Vöcking,et al.  Adaptive routing with stale information , 2009, Theor. Comput. Sci..

[10]  Kousha Etessami,et al.  The computational complexity of evolutionarily stable strategies , 2008, Int. J. Game Theory.

[11]  Karl H. Schlag,et al.  On the Evolution of Imitative Behavior , 1996 .

[12]  William L. Vickery,et al.  How to cheat against a simple mixed strategy ESS , 1987 .

[13]  G. P. Szegö,et al.  Stability theory of dynamical systems , 1970 .

[14]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[15]  Michael Kearns,et al.  Networks preserving evolutionary equilibria and the power of randomization , 2006, EC '06.

[16]  Noam Nisan,et al.  A Note on the computational hardness of evolutionary stable strategies , 2006, Electron. Colloquium Comput. Complex..

[17]  Berthold Vöcking,et al.  Fast convergence to Wardrop equilibria by adaptive sampling methods , 2006, STOC '06.