Extensions of two person zero sum games
From MaRDI portal
Cites work
Cited in
(15)- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
- On solving mean payoff games using pivoting algorithms
- Nash-solvable two-person symmetric cycle game forms
- Cyclic games and linear programming
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- On short paths interdiction problems: Total and node-wise limited interdiction
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- A convex programming-based algorithm for mean payoff stochastic games with perfect information
- A note on the approximation of mean-payoff games
- On canonical forms for zero-sum stochastic mean payoff games
- Seven things i know about them
- A nested family of \(k\)-total effective rewards for positional games
This page was built for publication: Extensions of two person zero sum games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234640)
