Arbeitspapier

Admissibility and common belief

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.

Language
Englisch

Bibliographic citation
Series: Memorandum ; No. 2000,07

Classification
Wirtschaft
Noncooperative Games
Subject
Spieltheorie
Theorie

Event
Geistige Schöpfung
(who)
Asheim, Geir B.
Dufwenberg, Martin
Event
Veröffentlichung
(who)
University of Oslo, Department of Economics
(where)
Oslo
(when)
2000

Handle
Last update
10.03.2025, 11:42 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Asheim, Geir B.
  • Dufwenberg, Martin
  • University of Oslo, Department of Economics

Time of origin

  • 2000

Other Objects (12)