Finding all minimal CURB sets
AbstractSets 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).
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Stockholm School of Economics in its series Working Paper Series in Economics and Finance with number 722.
Length: 20 pages
Date of creation: 01 Jul 2009
Date of revision:
Contact details of provider:
Postal: The Economic Research Institute, Stockholm School of Economics, P.O. Box 6501, 113 83 Stockholm, Sweden
Phone: +46-(0)8-736 90 00
Fax: +46-(0)8-31 01 57
Web page: http://www.hhs.se/
More information through EDIRC
curb sets; rational behavior; rationalizability; minimality;
Other versions of this item:
- 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
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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).
If references are entirely missing, you can add them using this form.