Bounding Average-Energy Games
From MaRDI portal
Publication:2988367
DOI10.1007/978-3-662-54458-7_11zbMath1392.68115arXiv1610.07858OpenAlexW2546285752MaRDI QIDQ2988367
Mickael Randour, Patricia Bouyer, Piotr Hofman, Nicolas Markey, Martín G. Zimmermann
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07858
Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Reachability games with relaxed energy constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounding Average-Energy Games ⋮ On decidability and complexity of low-dimensional robot games ⋮ The Robot Routing Problem for Collecting Aggregate Stochastic Rewards ⋮ Unnamed Item ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
Cites Work
- 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
- Reachability in succinct one-counter games
- Energy parity games
- Pushdown processes: Games and model-checking
- 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
- Reachability in two-clock timed automata is PSPACE-complete
- Average-energy games
- Optimal Bounds for Multiweighted and Parametrised Energy Games
- Markov decision processes and stochastic games with total effective payoff
- Mean-Payoff Pushdown Games
- Bounding Average-Energy Games
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
- Better Quality in Synthesis through Quantitative Objectives
- Undecidability of Two-dimensional Robot Games
