License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2015.297
URN: urn:nbn:de:0030-drops-53729
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5372/
Go to the corresponding LIPIcs Volume Portal


Brihaye, Thomas ; Geeraerts, Gilles ; Haddad, Axel ; Monmege, Benjamin

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games

pdf-format:
12.pdf (0.6 MB)


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.

BibTeX - Entry

@InProceedings{brihaye_et_al:LIPIcs:2015:5372,
  author =	{Thomas Brihaye and Gilles Geeraerts and Axel Haddad and Benjamin Monmege},
  title =	{{To Reach or not to Reachl Efficient Algorithms for Total-Payoff Games}},
  booktitle =	{26th International Conference on Concurrency Theory (CONCUR 2015)},
  pages =	{297--310},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-91-0},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{42},
  editor =	{Luca Aceto and David de Frutos Escrig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5372},
  URN =		{urn:nbn:de:0030-drops-53729},
  doi =		{10.4230/LIPIcs.CONCUR.2015.297},
  annote =	{Keywords: Games on graphs, reachability, quantitative games, value iteration}
}

Keywords: Games on graphs, reachability, quantitative games, value iteration
Seminar: 26th International Conference on Concurrency Theory (CONCUR 2015)
Issue Date: 2015
Date of publication: 25.08.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI