Log In Sign Up

Energy mean-payoff games

by   Véronique Bruyère, et al.

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.


page 1

page 2

page 3

page 4


Finite-memory strategies in two-player infinite games

We study infinite two-player win/lose games (A,B,W) where A,B are finite...

Concurrent games and semi-random determinacy

Consider concurrent, infinite duration, two-player win/lose games played...

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games

We study countably infinite stochastic 2-player games with reachability ...

Reachability Games with Relaxed Energy Constraints

We study games with reachability objectives under energy constraints. We...

Reaching Your Goal Optimally by Playing at Random

Shortest-path games are two-player zero-sum games played on a graph equi...

The operator approach to entropy games

Entropy games and matrix multiplication games have been recently introdu...

The Adversarial Stackelberg Value in Quantitative Games

In this paper, we study the notion of adversarial Stackelberg value for ...