Cyclic games and an algorithm to find minimax cycle means in directed graphs
DOI10.1016/0041-5553(88)90012-2zbMATH Open0695.90105OpenAlexW2008632553MaRDI QIDQ3471889FDOQ3471889
Authors: Alexander V. Karzanov, Vladimir Gurvich, Leonid G. Khachiyan
Publication date: 1988
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(88)90012-2
perfect informationvaluecyclic gamedirected bipartite graphpure stationary strategiesTwo-person zero-sum stochastic gamesminimax mean cycle
Cited In (58)
- On the Existence of Stationary Nash Equilibria for Mean Payoff Games on Graphs
- On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
- Solving mean-payoff games via quasi dominions
- Solving mean-payoff games via quasi dominions
- Nash Equilibria Conditions for Cyclic Games with p Players
- On solving mean payoff games using pivoting algorithms
- Tropical linear-fractional programming and parametric mean payoff games
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- Title not available (Why is that?)
- The complexity of infinitely repeated alternating move games
- Using strategy improvement to stay alive
- Nash-solvable two-person symmetric cycle game forms
- Title not available (Why is that?)
- Tropical Fourier-Motzkin elimination, with an application to real-time verification
- The Theory of Universal Graphs for Infinite Duration Games
- Solving parity games via priority promotion
- Cyclic games and linear programming
- The complexity of mean payoff games
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Hyperplane separation technique for multidimensional mean-payoff games
- A search game on a cyclic graph
- Equilibria in nonantagonistic positional games on graphs and searching for them
- Looking at mean-payoff and total-payoff through windows
- An average polynomial algorithm for solving antagonistic games on graphs
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- Tropicalizing the simplex algorithm
- Discrete control and algorithms for solving antagonistic dynamic games on networks
- Exponential examples of solving parity games
- A delayed promotion policy for parity games
- A delayed promotion policy for parity games
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
- Highway games on weakly cyclic graphs
- On short paths interdiction problems: Total and node-wise limited interdiction
- Equilibria in pure strategies for a two-player zero-sum average stochastic positional game
- Faster algorithms for mean-payoff games
- From Parity and Payoff Games to Linear Programming
- Tropical polyhedra are equivalent to mean payoff games
- Optimal paths in network games with \(p\) players
- On Nash equilibria in stochastic positional games with average payoffs
- Approximating the minimum cycle mean
- A convex programming-based algorithm for mean payoff stochastic games with perfect information
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- A note on the approximation of mean-payoff games
- Robust worst cases for parity games algorithms
- On canonical forms for zero-sum stochastic mean payoff games
- Qualitative analysis of concurrent mean-payoff games
- New algorithms for solving tropical linear systems
- On memoryless quantitative objectives
- The complexity of mean payoff games on graphs
- A nested family of \(k\)-total effective rewards for positional games
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- Stochastic mean payoff games: smoothed analysis and approximation schemes
- Scientific contributions of Leo Khachiyan (a short overview)
- The GKK algorithm is the fastest over simple mean-payoff games
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Combinatorial structure and randomized subexponential algorithms for infinite games
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
This page was built for publication: Cyclic games and an algorithm to find minimax cycle means in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3471889)