Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/63073 
Year of Publication: 
2000
Series/Report no.: 
Memorandum No. 2000,07
Publisher: 
University of Oslo, Department of Economics, Oslo
Abstract: 
The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all opponent strategies or on the union of the choice sets that are deemed possible for the opponent. The concept refines the Dekel-Fudenberg procedure and captures aspects of forward induction.
JEL: 
C72
Document Type: 
Working Paper

Files in This Item:
File
Size
322.74 kB





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