Finding all minimal curb sets
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).
|Date of creation:||18 Dec 2009|
|Date of revision:|
|Note:||View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00442118/en/|
|Contact details of provider:|| Web page: https://hal.archives-ouvertes.fr/|
When requesting a correction, please mention this item's handle: RePEc:hal:wpaper:hal-00442118. 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: (CCSD)
If references are entirely missing, you can add them using this form.