Finding all minimal curb sets

Max Klimm and Jörgen Weibull
Additional contact information
Max Klimm: MPII - Max-Planck-Institut für Informatik - Max-Planck-Gesellschaft

Working Papers from HAL

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

Keywords: curb set; rational behavior; algorithm; rationalizability.; rationalizability (search for similar items in EconPapers)
Date: 2009-12-18
Note: View the original document on HAL open archive server: https://hal.science/hal-00442118
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://hal.science/hal-00442118/document (application/pdf)

Related works:
Working Paper: Finding all minimal CURB sets (2009)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:wpaper:hal-00442118

Access Statistics for this paper

More papers in Working Papers from HAL
Bibliographic data for series maintained by CCSD ().