 |
|
|
|
| HAL : hal-00140150, version 1 |
| DOI : 10.1007/978-3-540-73420-8_73 |
| Fiche détaillée |  Récupérer au format |
|
|
| ICALP 07, Wroclaw : Poland (2007) |
|
|
|
|
| Perfect Information Stochastic Priority Games |
|
|
| Hugo Gimbert 1Wieslaw Zielonka 2 |
|
|
| French ANR-SETI project AVERISS Collaboration(s) |
|
|
| (09/07/2007) |
|
|
|
| We introduce stochastic priority games - a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination of the classical discount payoff and of a limit payoff evaluating the performance at infinity. Shapley games and parity games are special extreme cases of priority games. |
|
|
|
|
|
|
|
|
|
|
|
| 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 : | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
|
|
|
CNRS : UMR7089 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Informatique et théorie des jeux |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00140150, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00140150 | |
| oai:hal.archives-ouvertes.fr:hal-00140150 | |
| Contributeur : Hugo Gimbert | |
| Soumis le : Jeudi 5 Avril 2007, 10:44:56 | |
| Dernière modification le : Mercredi 18 Mars 2009, 10:35:45 | |
