Finding all minimal curb sets - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Finding all minimal curb sets

Résumé

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).
Fichier principal
Vignette du fichier
2009-56.pdf (266.59 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00442118 , version 1 (18-12-2009)

Identifiants

  • HAL Id : hal-00442118 , version 1

Citer

Max Klimm, Jörgen Weibull. Finding all minimal curb sets. 2009. ⟨hal-00442118⟩

Collections

X
169 Consultations
222 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More