scientific article; zbMATH DE number 7649929
From MaRDI portal
Publication:5875382
DOI10.4230/LIPICS.CONCUR.2019.21MaRDI QIDQ5875382
Quentin Hautem, Véronique Bruyère, Mickael Randour, Jean-François Raskin
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1907.01359
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
two-player zero-sum games played on graphscomplexity study and construction of optimal strategiesenergy and mean-payoff objectives
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster algorithms for mean-payoff games
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- Energy parity games
- Optimizing the expected mean payoff in energy Markov decision processes
- 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
- Computer aided synthesis: a game-theoretic approach
- Average-energy games
- Solving Parity Games on Integer Vectors
- Optimal Bounds for Multiweighted and Parametrised Energy Games
- Generalized Mean-payoff and Energy Games
- Robust Multidimensional Mean-Payoff Games are Undecidable
- Bounding Average-Energy Games
- Energy Games in Multiweighted Automata
- Graph Games and Reactive Synthesis
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- On the complexity of heterogeneous multidimensional quantitative games
- Infinite-state energy games
- The Complexity of Mean-Payoff Pushdown Games
- Playing Games with Counter Automata
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- Battery transition systems
- CONCUR 2005 – Concurrency Theory
This page was built for publication:
