Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/56096 
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKlimm, Maxen
dc.contributor.authorWeibull, Jörgen W.en
dc.date.accessioned2012-02-14-
dc.date.accessioned2012-03-28T13:03:05Z-
dc.date.available2012-03-28T13:03:05Z-
dc.date.issued2009-
dc.identifier.urihttp://hdl.handle.net/10419/56096-
dc.description.abstractSets 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).en
dc.language.isoengen
dc.publisher|aStockholm School of Economics, The Economic Research Institute (EFI) |cStockholmen
dc.relation.ispartofseries|aSSE/EFI Working Paper Series in Economics and Finance |x722en
dc.subject.jelC02en
dc.subject.jelC62en
dc.subject.jelC63en
dc.subject.jelC72en
dc.subject.ddc330en
dc.subject.keywordcurb setsen
dc.subject.keywordrational behavioren
dc.subject.keywordrationalizabilityen
dc.subject.keywordminimalityen
dc.subject.stwNichtkooperatives Spielen
dc.subject.stwSpieltheorieen
dc.subject.stwRationale Erwartungen
dc.subject.stwMathematiken
dc.subject.stwAlgorithmusen
dc.titleFinding all minimal CURB sets-
dc.typeWorking Paperen
dc.identifier.ppn615502466en
dc.rightshttp://www.econstor.eu/dspace/Nutzungsbedingungenen

Files in This Item:
File
Size
236.15 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.