 |
 |
 |
|
|
|
| HAL : hal-00442118, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
|
|
| Finding all minimal curb sets |
|
|
| Max Klimm 1Jörgen Weibull 2, 3 |
|
|
| (18/12/2009) |
|
|
|
| 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). |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Institut fur Mathematik |
|
|
|
Technische Universität Berlin |
|
|
| 2 : | Department of Economics (SSE) |
|
|
|
Stockholm School of Economics |
|
|
| 3 : | Department of Economics, Ecole Polytechnique |
|
|
|
CNRS : UMR7176 – Polytechnique - X |
|
|
|
|
|
|
|
|
|
| Discipline | : | Sciences de l'Homme et Société/Economie et finances |
|
|
| curb set – rational behavior – algorithm – rationalizability. |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00442118, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00442118/fr/ | |
| oai:halshs.archives-ouvertes.fr:hal-00442118_v1 | |
| Contributeur : Department Of Economics | |
| Soumis le : Vendredi 18 Décembre 2009, 11:53:33 | |
| Dernière modification le : Vendredi 18 Décembre 2009, 14:57:12 | |
