Arbeitspapier

Finding all minimal CURB sets

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).

Sprache
Englisch

Erschienen in
Series: SSE/EFI Working Paper Series in Economics and Finance ; No. 722

Klassifikation
Wirtschaft
Mathematical Methods
Existence and Stability Conditions of Equilibrium
Computational Techniques; Simulation Modeling
Noncooperative Games
Thema
curb sets
rational behavior
rationalizability
minimality
Nichtkooperatives Spiel
Spieltheorie
Rationale Erwartung
Mathematik
Algorithmus

Ereignis
Geistige Schöpfung
(wer)
Klimm, Max
Weibull, Jörgen W.
Ereignis
Veröffentlichung
(wer)
Stockholm School of Economics, The Economic Research Institute (EFI)
(wo)
Stockholm
(wann)
2009

Handle
Letzte Aktualisierung
20.09.2024, 08:23 MESZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Objekttyp

  • Arbeitspapier

Beteiligte

  • Klimm, Max
  • Weibull, Jörgen W.
  • Stockholm School of Economics, The Economic Research Institute (EFI)

Entstanden

  • 2009

Ähnliche Objekte (12)