Stockholm School of Economics >
EFI - The Economic Research Institute, Stockholm School of Economics >
SSE/EFI Working Paper Series in Economics and Finance, EFI - The Economic Research Institute, Stockholm School of Economics >
Please use this identifier to cite or link to this item:
| || |
|Title:||Finding all minimal CURB sets |
Weibull, Jörgen W.
|Issue Date:||2009 |
|Series/Report no.:||SSE/EFI Working Paper Series in Economics and Finance 722|
|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).|
|Document Type:||Working Paper|
|Appears in Collections:||SSE/EFI Working Paper Series in Economics and Finance, EFI - The Economic Research Institute, Stockholm School of Economics|
Download bibliographical data as:
Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.