On solving mean payoff games using pivoting algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 1059247 (Why is no real title available?)
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- A generalization of the linear complementarity problem
- Bimatrix Equilibrium Points and Mathematical Programming
- Completely mixed strategies for two structured classes of semi-Markov games, principal pivot transform and its generalizations
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Cyclic games and linear programming
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Duality between invariant spaces for max-plus linear discrete event systems
- Extensions of two person zero sum games
- Faster algorithms for mean-payoff games
- Fundamentals of Computation Theory
- Introduction to algorithms
- Linear complementarity problems solvable by A single linear program
- Mean cost cyclical games
- On Nonterminating Stochastic Games
- Pivoting algorithms for some classes of stochastic games: A survey
- Positional strategies for mean payoff games
- Stochastic Games
- Stochastic Games with Perfect Information and Time Average Payoff
- The complexity of mean payoff games on graphs
- The complexity of stochastic games
- The generalized linear complementarity problem revisited
- Tropical polyhedra are equivalent to mean payoff games
Cited in
(4)
This page was built for publication: On solving mean payoff games using pivoting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689394)
