Imitation Games and Computation
AbstractTAn imitation game is a finite two person normal form game in which the two players have the same set of pure strategies and the goal of the second player is to choose the same pure strategy as the first player. Gale et al. (1950) gave a way of passing from a given two person game to a symmetric game whose symmetric Nash equilibria are in oneto-one correspondence with the Nash equilibria of the given game. We give a way of passing from a given symmetric two person game to an imitation game whose Nash equilibria are in one-to-one correspondence with the symmetric Nash equilibria of the given symmetric game. Lemke (1965) portrayed the Lemke-Howson algorithm as a special case of the Lemke paths algorithm. Using imitation games, we show how Lemke paths may be obtained by projecting Lemke-Howson paths.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by School of Economics, University of Queensland, Australia in its series Discussion Papers Series with number 359.
Date of creation: 2008
Date of revision:
Other versions of this item:
- NEP-ALL-2008-04-04 (All new papers)
- NEP-GTH-2008-04-04 (Game Theory)
- NEP-MIC-2008-04-04 (Microeconomics)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, Econometric Society, vol. 74(2), pages 397-429, 03.
- Gilboa, Itzhak & Zemel, Eitan, 1989.
"Nash and correlated equilibria: Some complexity considerations,"
Games and Economic Behavior, Elsevier,
Elsevier, vol. 1(1), pages 80-93, March.
- Itzhak Gilboa & Eitan Zemel, 1988. "Nash and Correlated Equilibria: Some Complexity Considerations," Discussion Papers, Northwestern University, Center for Mathematical Studies in Economics and Management Science 777, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, Elsevier, vol. 63(2), pages 642-662, July.
- McLennan, Andrew & Tourky, Rabee, 2008. "Games in oriented matroids," Journal of Mathematical Economics, Elsevier, vol. 44(7-8), pages 807-821, July.
- McLennan, Andrew & Tourky, Rabee, 2010. "Simple complexity from imitation games," Games and Economic Behavior, Elsevier, Elsevier, vol. 68(2), pages 683-688, March.
- C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, INFORMS, vol. 11(7), pages 681-689, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Randal Anderson).
If references are entirely missing, you can add them using this form.