 |
 |
 |
|
|
|
| HAL: hal-00442118, version 1 |
| Detailed view |  Export this paper |
 |
|
|
| Finding all minimal curb sets |
|
|
| Max Klimm 1Jörgen Weibull 2, 3 |
|
|
| (2009-12-18) |
|
|
|
| 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: | Max Planck Institut für Informatik (MPII) |
|
|
|
Max-Planck-Institut |
|
|
| 2: | Department of Economics (SSE) |
|
|
|
Stockholm School of Economics |
|
|
| 3: | Department of Economics, Ecole Polytechnique |
|
|
|
CNRS : UMR7176 – Polytechnique - X |
|
|
|
|
|
|
|
|
|
| Subject | : | Humanities and Social Sciences/Economy and finances |
|
|
| curb set – rational behavior – algorithm – rationalizability. |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00442118, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00442118 | |
| oai:hal.archives-ouvertes.fr:hal-00442118 | |
| From: Department Of Economics | |
| Submitted on: Friday, 18 December 2009 11:53:33 | |
| Updated on: Friday, 18 December 2009 14:57:12 | |
