IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v10y1997i2p139-68.html
   My bibliography  Save this article

Algorithms for Finding Repeated Game Equilibria

Author

Listed:
  • Cronshaw, Mark B

Abstract

This paper describes computational techniques for finding all equilibria in infinitely repeated games with discounting and perfect monitoring. It illustrates these techniques with a three player Cournot game. This is the first infinitely repeated three player game ever solved. The paper also presents the solution for the set of equilibria in a two country tariff war. In both games the set of equilibria is large even when the players are not patient. Citation Copyright 1997 by Kluwer Academic Publishers.

Suggested Citation

  • Cronshaw, Mark B, 1997. "Algorithms for Finding Repeated Game Equilibria," Computational Economics, Springer;Society for Computational Economics, vol. 10(2), pages 139-168, May.
    • Handle: RePEc:kap:compec:v:10:y:1997:i:2:p:139-68
    as

    Download full text from publisher

    File URL: http://journals.kluweronline.com/issn/0927-7099/contents
    Download Restriction: Access to the full text of the articles in this series is restricted.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Mitri Kitti, 2013. "Subgame Perfect Equilibria in Discounted Stochastic Games," Discussion Papers 87, Aboa Centre for Economics.
    2. Gary Gorton & Ping He, 2023. "Optimal monetary policy in a collateralized economy," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(1), pages 55-89, January.
    3. Burkov, Andriy & Chaib-draa, Brahim, 2015. "Computing equilibria in discounted dynamic games," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 863-884.
    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. Abraham Arpad & Nicola Pavoni, 2004. "Efficient Allocations, with Moral Hazard and Hidden Borrowing and Lending," Levine's Bibliography 122247000000000138, UCLA Department of Economics.
    6. 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.
    7. Kimmo Berg, 2016. "Elementary Subpaths in Discounted Stochastic Games," Dynamic Games and Applications, Springer, vol. 6(3), pages 304-323, September.
    8. Osterdal, Lars Peter, 2003. "A note on the stability of collusion in differentiated oligopolies," Research in Economics, Elsevier, vol. 57(1), pages 53-64, March.
    9. 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.
    10. Arpad Abraham & Nicola Pavoni, 2008. "Efficient Allocations with Moral Hazard and Hidden Borrowing and Lending: A Recursive Formulation," Review of Economic Dynamics, Elsevier for the Society for Economic Dynamics, vol. 11(4), pages 781-803, October.
    11. Kimmo Berg & Mitri Kitti, 2014. "Equilibrium Paths in Discounted Supergames," Discussion Papers 96, Aboa Centre for Economics.

    More about this item

    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:kap:compec:v:10:y:1997:i:2:p:139-68. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.