The Theory of Universal Graphs for Infinite Duration Games
From MaRDI portal
Recommendations
Cites work
- A faster deterministic exponential time algorithm for energy games and mean payoff games
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- A subexponential bound for linear programming
- Alternating weak automata from universal trees
- An application of simultaneous diophantine approximation in combinatorial optimization
- Clique-Width and Parity Games
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Deciding parity games in quasipolynomial time
- Fast mu-calculus model checking when tree-width is bounded.
- Faster algorithms for mean-payoff games
- Formal Methods for Components and Objects
- Half-Positional Determinacy of Infinite Games
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 7533361 (Why is no real title available?)
- scientific article; zbMATH DE number 7650845 (Why is no real title available?)
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Linear programming, the simplex algorithm and simple polytopes
- Parity and Streett games with costs
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Positional strategies for mean payoff games
- Quasipolynomial set-based symbolic algorithms for parity games
- Register games
- Solving Games Without Determinization
- Succinct progress measures for solving parity games
- The bridge between regular cost functions and omega-regular languages
- The complexity of mean payoff games on graphs
- The complexity of multi-mean-payoff and multi-energy games
- The Theory of Stabilisation Monoids and Regular Cost Functions
- The Theory of Universal Graphs for Infinite Duration Games
- Universal graphs and good for games automata: new tools for infinite duration games
- Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
Cited in
(11)- Weak observable liveness and infinite games on finite graphs
- The theory of universal graphs for games: past and future
- Universal graphs and good for games automata: new tools for infinite duration games
- The Theory of Universal Graphs for Infinite Duration Games
- Playing Safe, Ten Years Later
- Characterizing positionality in games of Infinite duration over infinite graphs
- Half-positional objectives recognized by deterministic Büchi automata
- Characterizing positionality in games of infinite duration over infinite graphs
- Positional \(\omega\)-regular languages
- Positional -regular languages
- Positionality in _0² and a completeness result
This page was built for publication: The Theory of Universal Graphs for Infinite Duration Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043588)
