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

Abstract : 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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01414114
Contributor : Benjamin Monmege <>
Submitted on : Tuesday, December 13, 2016 - 10:23:32 PM
Last modification on : Monday, March 4, 2019 - 2:04:27 PM

File

priced-games.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

Collections

Citation

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica, Springer Verlag, 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⟩

Share

Metrics

Record views

422

Files downloads

135