| Article ID: | iaor19941843 |
| Country: | Germany |
| Volume: | 22 |
| Start Page Number: | 309 |
| End Page Number: | 318 |
| Publication Date: | Jan 1993 |
| Journal: | International Journal of Game Theory |
| Authors: | Neme A. |
The paper considers the infinitely-repeated prisoners’ dilemma with lexicographic complexity costs, where transitional complexity between states is included as one aspect of overall strategic complexity. It proves that a full folk theorem obtains in presence of any level of perfection of the equilibrium strategy, if the players consider off-equilibrium path payoff prior to minimizing complexity.