IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v17y2001i2p325-344.html
   My bibliography  Save this article

On the computation of stable sets and strictly perfect equilibria

Author

Listed:
  • Mathijs Jansen
  • Dries Vermeulen

Abstract

In this paper a procedure is described that computes for a given bimatrix game all stable sets in the sense of Kohlberg and Mertens (1986). Further the procedure is refined to find the strictly perfect equilibria (if any) of such a game.

Suggested Citation

  • Mathijs Jansen & Dries Vermeulen, 2001. "On the computation of stable sets and strictly perfect equilibria," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 17(2), pages 325-344.
    • Handle: RePEc:spr:joecth:v:17:y:2001:i:2:p:325-344
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00199/papers/1017002/10170325.pdf
    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. Belderbos, Rene & Carree, Martin & Lokshin, Boris, 2004. "Cooperative R&D and firm performance," Research Policy, Elsevier, vol. 33(10), pages 1477-1492, December.
    2. Yves Breitmoser & Jonathan Tan & Daniel Zizzo, 2010. "Understanding perpetual R&D races," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 44(3), pages 445-467, September.
    3. Bharat Adsul & Jugal Garg & Ruta Mehta & Milind Sohoni & Bernhard von Stengel, 2021. "Fast Algorithms for Rank-1 Bimatrix Games," Operations Research, INFORMS, vol. 69(2), pages 613-631, March.

    More about this item

    Keywords

    Bimatrix game; Computation; Stable equilibrium; Strictly perfect equilibrium.;
    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

    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:spr:joecth:v:17:y:2001:i:2:p:325-344. 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.