This paper studies a two-player machine (finite automaton) game in which an extensive game with perfect information is infinitely repeated. We introduce a new measure of strategic complexity named "multiple complexity", which considers the responsiveness of a strategy to information as well as the number of states of machines. In contrast to Piccione and Rubinstein (1993), we prove that a machine game may include non-trivial Nash equilibria. In the sequential-move prisoners' dilemma, cooperation can be sustained in an equilibrium of the machine game.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Graduate School of Economics, Hitotsubashi University in its series Discussion Papers with number
2006-07.