submit
english version rss feed
HAL: hal-00438359, version 1

Detailed view  Export this paper
Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games
Hugo Gimbert 1, Wieslaw Zielonka 2
(2009-12-02)

We consider two-players zero-sum perfect information stochastic games with finitely many states and actions and examine the problem of existence of pure stationary optimal strategies. We show that the existence of such strategies for one-player games (Markov decision processes) implies the existence of such strategies for two-player games. The result is general and holds for any payoff mapping.
1:  Laboratoire Bordelais de Recherche en Informatique (LaBRI)
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux – Université Victor Segalen - Bordeaux II
2:  Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA)
CNRS : UMR7089 – Université Paris VII - Paris Diderot
Computer Science/Computer Science and Game Theory
stochastic games – pure and stationary optimal strategies – parity games
Attached file list to this document: 
PDF
pure_stationary_optimal_stochastic_games_gimbert_zielonka.pdf(219.4 KB)

all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...