Advertisement

Computational Economics

, Volume 49, Issue 3, pp 387–404 | Cite as

Extremal Pure Strategies and Monotonicity in Repeated Games

  • Kimmo Berg
Article

Abstract

The recent development of computational methods in repeated games has made it possible to study the properties of subgame-perfect equilibria in more detail. This paper shows that the lowest equilibrium payoffs may increase in pure strategies when the players become more patient and this may cause the set of equilibrium paths to be non-monotonic. A numerical example is constructed such that a path is no longer equilibrium when the players’ discount factors increase. This property can be more easily seen when the players have different time preferences, since in these games the punishment strategies may rely on the differences between the players’ discount factors. A sufficient condition for the monotonicity of equilibrium paths is that the lowest equilibrium payoffs do not increase, i.e., the punishments should not become milder.

Keywords

Repeated games Minimum payoff Monotonicity Equilibrium path Unequal discount factors Subgame perfection 

Notes

Acknowledgments

The author thanks the reviewers for the valuable suggestions for improving the paper, and acknowledges funding from Emil Aaltosen Säätiö through Post doc -pooli.

References

  1. Abreu, D. (1988). On the theory of infinitely repeated games with discounting. Econometrica, 56(2), 383–396.CrossRefGoogle Scholar
  2. Abreu, D., Dutta, P. K., & Smith, L. (1994). The folk theorem for repeated games: A Neu condition. Econometrica, 62(4), 393–948.CrossRefGoogle Scholar
  3. Abreu, D., Pearce, D., & Stacchetti, E. (1986). Optimal cartel equilibria with imperfect monitoring. Journal of Economic Theory, 39(1), 251–269.CrossRefGoogle Scholar
  4. Abreu, D., Pearce, D., & Stacchetti, E. (1990). Toward a theory of discounted repeated games with imperfect monitoring. Econometrica, 58(5), 1041–1063.CrossRefGoogle Scholar
  5. Abreu, D., & Sannikov, Y. (2014). An algorithm for two-player games with perfect monitoring. Theoretical Economics, 9(2), 313–338.CrossRefGoogle Scholar
  6. Berg, K. (2015). Elementary subpaths in discounted stochastic games. Dynamic Games and Applications. doi: 10.1007/s13235-015-0151-5.
  7. Berg, K., & Kitti, M. (2015). Equilibrium paths in discounted supergames. Working paper. http://sal.aalto.fi/publications/pdf-files/mber09b.
  8. Berg, K., & Kitti, M. (2014). Fractal geometry of equilibrium payoffs in discounted supergames. Fractals, 22(4), 1450016.CrossRefGoogle Scholar
  9. Berg, K., & Kitti, M. (2013). Computing equilibria in discounted \(2\times 2\) supergames. Computational Economics, 41, 71–78.CrossRefGoogle Scholar
  10. Berg, K., & Kärki, M. (2014a). An algorithm for finding the minimal pure-strategy subgame-perfect equilibrium payoffs in repeated games. Working paper.Google Scholar
  11. Berg, K., & Kärki, M. (2014b). How patient the players need to be to get all the relevant payoffs in the symmetric \(2\times 2\) supergames? Working paper.Google Scholar
  12. Berg, K., & Schoenmakers, G. (2014). Construction of randomized subgame-perfect equilibria in repeated games. Working paper.Google Scholar
  13. Burkov, A., & Chaib-draa, B. (2010). An approximate subgame-perfect equilibrium computation technique for repeated games. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (pp. 729–736).Google Scholar
  14. Chen, B., & Takahashi, S. (2012). A folk theorem for repeated games with unequal discounting. Games and Economic Behavior, 76(2), 571–581.CrossRefGoogle Scholar
  15. Cronshaw, M. B. (1997). Algorithms for finding repeated game equilibria. Computational Economics, 10, 139–168.CrossRefGoogle Scholar
  16. Cronshaw, M. B., & Luenberger, D. G. (1994). Strongly symmetric subgame perfect equilibria in infinitely repeated games with perfect monitoring. Games and Economic Behavior, 6, 220–237.CrossRefGoogle Scholar
  17. Fudenberg, D., & Maskin, E. (1986). The folk theorem in repeated games with discounting and incomplete information. Econometrica, 54(3), 533–554.CrossRefGoogle Scholar
  18. Fudenberg, D., & Tirole, J. (1991). Game theory. Cambridge, MA: The MIT Press.Google Scholar
  19. Gossner, O., & Hörner, J. (2010). When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff? Journal of Economic Theory, 145(1), 63–84.CrossRefGoogle Scholar
  20. Guéron, Y., Thibaut, L., & Thomas, C. D. (2011). On the folk theorem with one-dimensional payoffs and different discount factors. Games and Economic Behavior, 73(1), 287–295.CrossRefGoogle Scholar
  21. Houba, H., & Wen, Q. (2011). Extreme equilibria in the negotiation model with different time preferences. Games and Economic Behavior, 73, 507–516.CrossRefGoogle Scholar
  22. Judd, K., Yeltekin, Ş., & Conklin, J. (2003). Computing supergame equilibria. Econometrica, 71, 1239–1254.CrossRefGoogle Scholar
  23. Lehrer, E., & Pauzner, A. (1999). Repeated games with differential time preferences. Econometrica, 67, 393–412.CrossRefGoogle Scholar
  24. Madani, O., Thorup, M., & Zwick, U. (2010). Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. ACM Transactions on Algorithms, 6(2), 33:1–33:25.CrossRefGoogle Scholar
  25. Mailath, G. J., Obara, I., & Sekiguchi, T. (2002). The maximum efficient equilibrium payoff in the repeated prisoners’ dilemma. Games and Economic Behavior, 40, 99–122.CrossRefGoogle Scholar
  26. Mailath, G. J., & Samuelson, L. (2006). Repeated games and reputations: Long-run relationships. Oxford: Oxford University Press.CrossRefGoogle Scholar
  27. Papadimitriou, C., & Tsitsiklis, J. N. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12(3), 441–450.CrossRefGoogle Scholar
  28. Salcedo, B., & Sultanum, B. (2012). Computation of subgame-perfect equilibria of repeated games with perfect monitoring and public randomization. Working paper.Google Scholar
  29. Salonen, H., & Vartiainen, H. (2008). Valuating payoff streams under unequal discount factors. Economics Letters, 99(3), 595–598.CrossRefGoogle Scholar
  30. Stahl, D. O. (1991). The graph of prisoners’ dilemma supergame payoffs as a function of the discount factor. Games and Economic Behavior, 3, 368–384.CrossRefGoogle Scholar
  31. Wen, Q. (1994). The “folk theorem” for repeated games with complete information. Econometrica, 62(4), 949–954.CrossRefGoogle Scholar
  32. Yamamoto, Y. (2010). The use of public randomization in discounted repeated games. International Journal of Game Theory, 39, 431–443.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Mathematics and Systems AnalysisAalto University School of ScienceAaltoFinland

Personalised recommendations