eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-08-20
21:1
21:17
10.4230/LIPIcs.CONCUR.2019.21
article
Energy Mean-Payoff Games
Bruyère, Véronique
1
Hautem, Quentin
1
Randour, Mickael
2
Raskin, Jean-François
3
Université de Mons (UMONS), Belgium
Université de Mons (F.R.S.-FNRS & UMONS), Belgium
Université libre de Bruxelles (ULB), Belgium
In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2-dimensional weight vectors. The objective of the first player (the protagonist) is to satisfy an energy objective on the first dimension and a mean-payoff objective on the second dimension. We show that optimal strategies for the first player may require infinite memory while optimal strategies for the second player (the antagonist) do not require memory. In the one-player case (where only the first player has choices), the problem of deciding who is the winner can be solved in polynomial time while for the two-player case we show co-NP membership and we give effective constructions for the infinite-memory optimal strategies of the protagonist.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol140-concur2019/LIPIcs.CONCUR.2019.21/LIPIcs.CONCUR.2019.21.pdf
two-player zero-sum games played on graphs
energy and mean-payoff objectives
complexity study and construction of optimal strategies