Communication Dans Un Congrès Année : 2004

When can you play positionnaly?

Résumé

We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless) optimal strategies. We show that all popular payoff mappings, such as mean payoff, discounted, parity as well as several other payoffs satisfy these conditions. This approach allows to give a uniform treatment of otherwise disparate results concerning the existence of positional optimal strategies.

Mots clés

Fichier principal
Vignette du fichier
memoryless.pdf (167.36 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-00160436 , version 1 (06-07-2007)

Licence

Identifiants

  • HAL Id : hal-00160436 , version 1

Citer

Hugo Gimbert, Wieslaw Zielonka. When can you play positionnaly?. Mathematical Foundations of Computer Science 2004, 2004, Prague, Czech Republic. pp.686-697. ⟨hal-00160436⟩
150 Consultations
394 Téléchargements

Partager

  • More