Fiche du document
18 décembre 2009
- handle: 10670/1.8cx7qn
- hal: hal-00442118
info:eu-repo/semantics/OpenAccess
Mots-clés
curb set rational behavior algorithm rationalizability. rationalizability C02, C62, C63, C72 C - Mathematical and Quantitative MethodsSujets proches
Animal behavior Habits and behaviorCiter ce document
Max Klimm et al., « Finding all minimal curb sets », HAL-SHS : économie et finance, ID : 10670/1.8cx7qn
Métriques
Partage / Export
Résumé
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).