Average-energy games

Abstract

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy. We study average-energy games, where the goal is to optimize the long-run average of the accumulated energy. We show that this objective arises naturally in several applications, and that it yields interesting connections with previous concepts in the literature. We prove that deciding the winner in such games is in NP inter coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win. We also consider the case where the system has to minimize the average-energy while maintaining the accumulated energy within predefined bounds at all times: this corresponds to operating with a finite-capacity storage for energy. We give results for one-player and two-player games, and establish complexity bounds and memory requirements.

In Proceedings GandALF 2015, arXiv:1509.06858

References in corpus (1)

• First Cycle Games

Cited by in corpus (7)

• Reachability Games with Relaxed Energy Constraints
• Limit Your Consumption! Finding Bounds in Average-energy Games
• Optimizing the Expected Mean Payoff in Energy Markov Decision Processes
• Reconciling Rationality and Stochasticity: Rich Behavioral Models in Two-Player Games
• Average-energy games (full version)
• Quantitative Reductions and Vertex-Ranked Infinite Games (Full Version)
• Average Stack Cost of Buechi Pushdown Automata