Average-energy games

DOI10.1007/s00236-016-0274-1zbMath1390.68115MaRDI QIDQ2413482

Patricia Bouyer, Simon Laursen, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen

Publication date: 10 April 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-016-0274-1

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A80: Applications of game theory

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Quantitative Automata under Probabilistic Semantics, Unnamed Item, Unnamed Item, On convergence of infinite matrix products with alternating factors from two sets of matrices, Average-energy games, Bounding Average-Energy Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• First-cycle games
• Faster algorithms for mean-payoff games
• The bad match; a total reward stochastic game
• Positional strategies for mean payoff games
• A characterization of the minimum cycle mean in a digraph
• The complexity of mean payoff games on graphs
• Automata, logics, and infinite games. A guide to current research
• Memoryless determinacy of parity and mean payoff games: a simple proof
• Strategy synthesis for multi-dimensional quantitative objectives
• The complexity of multi-mean-payoff and multi-energy games
• Looking at mean-payoff and total-payoff through windows
• Average-energy games
• Optimal Bounds for Multiweighted and Parametrised Energy Games
• Mean-Payoff Pushdown Games
• Quantitative timed simulation functions and refinement metrics for real-time systems
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Energy Parity Games
• Half-Positional Determinacy of Infinite Games
• Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
• Better Quality in Synthesis through Quantitative Objectives
• Games through Nested Fixpoints
• Mathematical Foundations of Computer Science 2004
• Synthesis from LTL Specifications with Mean-Payoff Objectives
• Reachability in Two-Clock Timed Automata Is PSPACE-Complete
• Term Rewriting and Applications
• CONCUR 2005 – Concurrency Theory