IDEAS home Printed from https://ideas.repec.org/p/tkk/dpaper/dp96.html
   My bibliography  Save this paper

Equilibrium Paths in Discounted Supergames

Author

Listed:
  • Kimmo Berg

    (Systems Analysis Laboratory, Aalto University School of Science)

  • Mitri Kitti

    (Department of Economics, University of Turku)

Abstract

This paper characterizes the subgame-perfect pure-strategy equilibrium paths in discounted supergames with perfect monitoring. It is shown that all the equilibrium paths are composed of fragments called elementary subpaths. This characterization result is complemented with an algorithm for finding the elementary subpaths. By using these subpaths it is possible to generate equilibrium paths and payoffs. When there are finitely many elementary subpaths, all the equilibrium paths can be represented by a directed graph. These graphs can be used in analyzing the complexity of equilibrium outcomes. In particular, it is shown that the size and the density of the equilibrium set can be measured by the asymptotic growth rate of equilibrium paths and the Hausdorff dimension of the payoff set.

Suggested Citation

  • Kimmo Berg & Mitri Kitti, 2014. "Equilibrium Paths in Discounted Supergames," Discussion Papers 96, Aboa Centre for Economics.
    • Handle: RePEc:tkk:dpaper:dp96
    as

    Download full text from publisher

    File URL: http://www.mitrikitti.fi/dp96.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kenneth L. Judd & Sevin Yeltekin & James Conklin, 2003. "Computing Supergame Equilibria," Econometrica, Econometric Society, vol. 71(4), pages 1239-1254, July.
    2. Salonen, Hannu & Vartiainen, Hannu, 2008. "Valuating payoff streams under unequal discount factors," Economics Letters, Elsevier, vol. 99(3), pages 595-598, June.
    3. Mailath, George J. & Obara, Ichiro & Sekiguchi, Tadashi, 2002. "The Maximum Efficient Equilibrium Payoff in the Repeated Prisoners' Dilemma," Games and Economic Behavior, Elsevier, vol. 40(1), pages 99-122, July.
    4. Abreu, Dilip & Pearce, David & Stacchetti, Ennio, 1986. "Optimal cartel equilibria with imperfect monitoring," Journal of Economic Theory, Elsevier, vol. 39(1), pages 251-269, June.
    5. Stahl, Dale II, 1991. "The graph of Prisoners' Dilemma supergame payoffs as a function of the discount factor," Games and Economic Behavior, Elsevier, vol. 3(3), pages 368-384, August.
    6. Drew Fudenberg & Eric Maskin, 2008. "The Folk Theorem In Repeated Games With Discounting Or With Incomplete Information," World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 11, pages 209-230, World Scientific Publishing Co. Pte. Ltd..
    7. Cronshaw, Mark B, 1997. "Algorithms for Finding Repeated Game Equilibria," Computational Economics, Springer;Society for Computational Economics, vol. 10(2), pages 139-168, May.
    8. Kimmo Berg & Mitri Kitti, 2013. "Computing Equilibria in Discounted 2 × 2 Supergames," Computational Economics, Springer;Society for Computational Economics, vol. 41(1), pages 71-88, January.
    9. Sorin, Sylvain, 1992. "Repeated games with complete information," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 4, pages 71-107, Elsevier.
    10. Abreu, Dilip, 1986. "Extremal equilibria of oligopolistic supergames," Journal of Economic Theory, Elsevier, vol. 39(1), pages 191-225, June.
    11. Abreu, Dilip, 1988. "On the Theory of Infinitely Repeated Games with Discounting," Econometrica, Econometric Society, vol. 56(2), pages 383-396, March.
    12. Abreu, Dilip & Sannikov, Yuliy, 2014. "An algorithm for two-player repeated games with perfect monitoring," Theoretical Economics, Econometric Society, vol. 9(2), May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jörn Künsemöller & Nan Zhang & Kimmo Berg & João Soares, 2017. "A game-theoretic evaluation of an ISP business model in caching," Information Systems Frontiers, Springer, vol. 19(4), pages 803-818, August.
    2. Mitri Kitti, 2014. "Equilibrium Payoffs for Pure Strategies in Repeated Games," Discussion Papers 98, Aboa Centre for Economics.
    3. Jörn Künsemöller & Nan Zhang & Kimmo Berg & João Soares, 0. "A game-theoretic evaluation of an ISP business model in caching," Information Systems Frontiers, Springer, vol. 0, pages 1-16.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kimmo Berg, 2017. "Extremal Pure Strategies and Monotonicity in Repeated Games," Computational Economics, Springer;Society for Computational Economics, vol. 49(3), pages 387-404, March.
    2. Kimmo Berg & Markus Kärki, 2018. "Critical Discount Factor Values in Discounted Supergames," Games, MDPI, vol. 9(3), pages 1-17, July.
    3. Kimmo Berg & Gijs Schoenmakers, 2017. "Construction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games," Games, MDPI, vol. 8(4), pages 1-14, November.
    4. Kimmo Berg & Mitri Kitti, 2013. "Computing Equilibria in Discounted 2 × 2 Supergames," Computational Economics, Springer;Society for Computational Economics, vol. 41(1), pages 71-88, January.
    5. Kimmo Berg, 2016. "Elementary Subpaths in Discounted Stochastic Games," Dynamic Games and Applications, Springer, vol. 6(3), pages 304-323, September.
    6. Mitri Kitti, 2013. "Subgame Perfect Equilibria in Discounted Stochastic Games," Discussion Papers 87, Aboa Centre for Economics.
    7. Mitri Kitti, 2013. "Conditional Markov equilibria in discounted dynamic games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 77-100, August.
    8. Susanne Goldlücke & Sebastian Kranz, 2018. "Discounted stochastic games with voluntary transfers," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 66(1), pages 235-263, July.
    9. Yongyang Cai & Yongyang Cai & Kenneth L. Judd, 2017. "Computing Equilibria of Dynamic Games," Operations Research, INFORMS, vol. 65(2), pages 337-356, April.
    10. Goldlücke, Susanne & Kranz, Sebastian, 2012. "Infinitely repeated games with public monitoring and monetary transfers," Journal of Economic Theory, Elsevier, vol. 147(3), pages 1191-1221.
    11. Haag, Matthew & Lagunoff, Roger, 2007. "On the size and structure of group cooperation," Journal of Economic Theory, Elsevier, vol. 135(1), pages 68-89, July.
    12. Mitri Kitti, 2014. "Equilibrium Payoffs for Pure Strategies in Repeated Games," Discussion Papers 98, Aboa Centre for Economics.
    13. Dasgupta, Ani & Ghosh, Sambuddha, 2022. "Self-accessibility and repeated games with asymmetric discounting," Journal of Economic Theory, Elsevier, vol. 200(C).
    14. Colombo, Luca & Labrecciosa, Paola, 2006. "Optimal punishments with detection lags," Economics Letters, Elsevier, vol. 92(2), pages 198-201, August.
    15. Colombo, Luca & Labrecciosa, Paola, 2006. "The suboptimality of optimal punishments in Cournot supergames," Economics Letters, Elsevier, vol. 90(1), pages 116-121, January.
    16. Takashi Kamihigashi & Taiji Furusawa, 2007. "Global Dynamics in Infinitely Repeated Games with Additively Separable Continuous Payoffs," Discussion Paper Series 210, Research Institute for Economics & Business Administration, Kobe University.
    17. Lambertini, Luca & Sasaki, Dan, 2001. "Marginal costs and collusive sustainability," Economics Letters, Elsevier, vol. 72(1), pages 117-120, July.
    18. Hörner, Johannes & Takahashi, Satoru, 2016. "How fast do equilibrium payoff sets converge in repeated games?," Journal of Economic Theory, Elsevier, vol. 165(C), pages 332-359.
    19. Burkov, Andriy & Chaib-draa, Brahim, 2015. "Computing equilibria in discounted dynamic games," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 863-884.
    20. Labrecciosa Paola & Colombo Luca, 2010. "Technology Uncertainty and Market Collusion," The B.E. Journal of Economic Analysis & Policy, De Gruyter, vol. 10(1), pages 1-17, March.

    More about this item

    Keywords

    repeated game; subgame-perfect equilibrium; equilibrium path; graph presentation of paths; complexity;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tkk:dpaper:dp96. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Susmita Baulia (email available below). General contact details of provider: https://edirc.repec.org/data/tukkkfi.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.