New algorithms for combinations of objectives using separating automata

DOI10.4204/eptcs.346.15MaRDI QIDQ6649527

Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Pierre Ohlmann, Unnamed Author, Jérôme Leroux

Publication date: 6 December 2024

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Games involving graphs (91A43) Formal languages and automata (68Q45) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Universal graphs and good for games automata: new tools for infinite duration games
• The complexity of multi-mean-payoff and multi-energy games
• Half-Positional Determinacy of Infinite Games
• Deciding parity games in quasipolynomial time
• Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
• A pseudo-quasi-polynomial algorithm for mean-payoff parity games
• Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
• Parity and Streett Games with Costs
• Generalized Parity Games

This page was built for publication: New algorithms for combinations of objectives using separating automata