 |
|
|
|
| HAL : hal-00559173, version 3 |
| Fiche détaillée |  Récupérer au format |
|
|
| Versions disponibles : | v1 (25-01-2011) | v2 (03-02-2011) | v3 (14-04-2011) |
|
|
|
|
| Computing Optimal Strategies for Markov Decision Processes with Parity and Positive-Average Conditions |
|
|
| Hugo Gimbert 1Youssouf Oualhadj 1 |
|
|
| (24/01/2011) |
|
|
|
| We study Markov decision processes (one-player stochastic games) equipped with parity and positive-average conditions. In these games, the goal of the player is to maximize the probability that both the parity and the positive-average conditions are fulfilled. We show that the values of these games are computable. We also show that optimal strategies exist, require only finite memory and can be effectively computed. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 2 : | Institute of Mathematical Sciences [India] (IMSc) |
|
|
|
Institute of Mathematical Sciences |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Informatique et théorie des jeux |
|
|
| Quantitative analysis – Parity games – Markov decision processes |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00559173, version 3 | |
| http://hal.archives-ouvertes.fr/hal-00559173 | |
| oai:hal.archives-ouvertes.fr:hal-00559173 | |
| Contributeur : Youssouf Oualhadj | |
| Soumis le : Jeudi 14 Avril 2011, 14:26:31 | |
| Dernière modification le : Mardi 19 Avril 2011, 16:16:17 | |
