Imitation games and computation

Andrew McLennan*, Rabee Tourky

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

An 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. We explain how, in two different settings, observations obtained from imitation games complete a circle of ideas, showing that phenomena that had for many years seemed to be distinct are actually superficially different manifestations of a single structure. First, one can pass from a given two person finite game to an imitation game whose Nash equilibria are in one-to-one correspondence with the Nash equilibria of the given game. Second, each of the paths of the procedure described in Lemke (1965) for solving a linear complementarity problem is the projection of the path of the Lemke-Howson algorithm applied to an imitation game.

Original languageEnglish
Pages (from-to)4-11
Number of pages8
JournalGames and Economic Behavior
Volume70
Issue number1
DOIs
Publication statusPublished - Sept 2010
Externally publishedYes

Fingerprint

Dive into the research topics of 'Imitation games and computation'. Together they form a unique fingerprint.

Cite this