IDEAS home Printed from https://ideas.repec.org/p/hhs/hastef/0722.html
   My bibliography  Save this paper

Finding all minimal CURB sets

Author

Listed:
  • Klimm, Max

    () (Technische Universität Berlin)

  • Weibull, Jörgen

    () (Dept. of Economics, Stockholm School of Economics)

Abstract

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is strongly closed under rational behavior, or sCURB, if it contains all best replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006).

Suggested Citation

  • Klimm, Max & Weibull, Jörgen, 2009. "Finding all minimal CURB sets," SSE/EFI Working Paper Series in Economics and Finance 722, Stockholm School of Economics.
  • Handle: RePEc:hhs:hastef:0722
    as

    Download full text from publisher

    File URL: http://swopec.hhs.se/hastef/papers/hastef0722.pdf
    Download Restriction: no

    Other versions of this item:

    More about this item

    Keywords

    curb sets; rational behavior; rationalizability; minimality;

    JEL classification:

    • C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
    • C62 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Existence and Stability Conditions of Equilibrium
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative 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:hhs:hastef:0722. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Helena Lundin). General contact details of provider: http://edirc.repec.org/data/erhhsse.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.