Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Acta Informatica Année : 2017

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games

Thomas Brihaye
  • Fonction : Auteur
  • PersonId : 962991
Axel Haddad
  • Fonction : Auteur
Benjamin Monmege

Résumé

Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games—that can be seen as a refinement of the well-studied mean-payoff games—are the variant where the payoff of a play is computed as the sum of the weights. Our aim is to describe the first pseudo-polynomial time algorithm for total-payoff games in the presence of arbitrary weights. It consists of a non-trivial application of the value iteration paradigm. Indeed, it requires to study, as a milestone, a refinement of these games, called min-cost reachability games, where we add a reachability objective to one of the players. For these games, we give an efficient value iteration algorithm to compute the values and optimal strategies (when they exist), that runs in pseudo-polynomial time. We also propose heuristics to speed up the computations.
Fichier principal
Vignette du fichier
priced-games.pdf (555.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01414114 , version 1 (13-12-2016)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica, 2017, Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015), 54 (1), pp.85--125. ⟨10.1007/s00236-016-0276-z⟩. ⟨hal-01414114⟩
315 Consultations
175 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More