Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
From MaRDI portal
Publication:5089201
Recommendations
- The complexity of mean payoff games on graphs
- On the Complexity of Value Iteration
- The complexity of mean payoff games
- The complexity of solving stochastic games on graphs
- Iterated regret minimization in game graphs
- Optimistic and topological value iteration for simple stochastic games
- Values of games with probabilistic graphs
- The theory of universal graphs for games: past and future
Cites work
- scientific article; zbMATH DE number 7650845 (Why is no real title available?)
- 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
- An application of simultaneous diophantine approximation in combinatorial optimization
- Combinatorial simplex algorithms can solve mean payoff games
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Deciding parity games in quasipolynomial time
- Faster algorithms for mean-payoff games
- Implicat Representation of Graphs
- 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
- Labeling schemes for nearest common ancestors through minor-universal trees
- Linear programming, the simplex algorithm and simple polytopes
- Mathematical problems for the next century
- Optimal distance labeling schemes for trees
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Positional strategies for mean payoff games
- Succinct progress measures for solving parity games
- The complexity of mean payoff games on graphs
- 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
Cited in
(7)- The Theory of Universal Graphs for Infinite Duration Games
- An objective improvement approach to solving discounted payoff games
- The worst-case complexity of symmetric strategy improvement
- New algorithms for combinations of objectives using separating automata
- An objective improvement approach to solving discounted payoff games
- The GKK algorithm is the fastest over simple mean-payoff games
- Fast algorithms for energy games in special cases
This page was built for publication: Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089201)
