Article Dans Une Revue Discrete Applied Mathematics Année : 2013

Patience of Matrix Games

Résumé

For matrix games we study how small nonzero probability must be used in optimal strategies. We show that for n×n win-lose-draw games (i.e.\ (1,0,1) matrix games) nonzero probabilities smaller than nO(n) are never needed. We also construct an explicit n×n win-lose game such that the unique optimal strategy uses a nonzero probability as small as nΩ(n). This is done by constructing an explicit (1,1) nonsingular n×n matrix, for which the inverse has only nonnegative entries and where some of the entries are of value nΩ(n).
Fichier principal
Vignette du fichier
MatrixGamePatience_revision.pdf (428) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00843052 , version 1 (10-07-2013)

Identifiants

Citer

Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias Tsigaridas. Patience of Matrix Games. Discrete Applied Mathematics, 2013, ⟨10.1016/j.dam.2013.05.008⟩. ⟨hal-00843052⟩
253 Consultations
176 Téléchargements

Altmetric

Partager

More