Scandinavian Working Papers in Economics
HomeAboutSeriesSubject/JEL codesAdvanced Search
The Economic Research Institute, Stockholm School of Economics SSE/EFI Working Paper Series in Economics and Finance

No 722:
Finding all minimal CURB sets

Max Klimm () and Jörgen Weibull ()

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 sets; rational behavior; rationalizability; minimality; (follow links to similar papers)

JEL-Codes: C02; C62; C63; C72; (follow links to similar papers)

20 pages, July 1, 2009

Before downloading any of the electronic versions below you should read our statement on copyright.
Download GhostScript for viewing Postscript files and the Acrobat Reader for viewing and printing pdf files.

Full text versions of the paper:

hastef0722.pdf    PDF-file (236kB) 
Download Statistics

Questions (including download problems) about the papers in this series should be directed to Helena Lundin ()
Report other problems with accessing this service to Sune Karlsson () or Helena Lundin ().

Programing by
Design by Joachim Ekebom

Handle: RePEc:hhs:hastef:0722 This page was generated on 2014-12-14 19:23:11