Optimal Strategies in Turn-Based Stochastic Tail Games - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Optimal Strategies in Turn-Based Stochastic Tail Games

Florian Horn

Résumé

Infinite stochastic games are a natural model for open reactive processes: one player represents the controller, and the other represents an hostile environment. The evolution of the system depends on the decisions of the players, supplemented by a random function. The problems on such games can be sorted in two categories: the qualitative analysis ponders whether a player can win with probability one (or arbitrarily close to one), while the quantitative analysis is concerned about the maximal (or supremal) value a player can achieve. In this paper, we establish the existence of optimal strategies in finite simple stochastic games. We also present a general effective procedure to derive quantitative results from qualitative algorithms. It also follows from the correctness of this procedure that optimal strategies are no more complex than almost-sure strategies.
Fichier principal
Vignette du fichier
optimal.pdf (220.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00370046 , version 1 (23-03-2009)

Identifiants

  • HAL Id : hal-00370046 , version 1

Citer

Florian Horn. Optimal Strategies in Turn-Based Stochastic Tail Games. 2009. ⟨hal-00370046⟩

Collections

ANR
28 Consultations
9 Téléchargements

Partager

Gmail Facebook X LinkedIn More