Extensions of two person zero sum games
From MaRDI portal
Publication:1234640
DOI10.1016/0022-247X(76)90178-5zbMath0348.90160WikidataQ56609426 ScholiaQ56609426MaRDI QIDQ1234640
Publication date: 1976
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
2-person games (91A05) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60)
Related Items (16)
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games ⋮ On canonical forms for zero-sum stochastic mean payoff games ⋮ Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ A convex programming-based algorithm for mean payoff stochastic games with perfect information ⋮ On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ A note on the approximation of mean-payoff games ⋮ On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness ⋮ On short paths interdiction problems: Total and node-wise limited interdiction ⋮ Cyclic games and linear programming ⋮ A nested family of \(k\)-total effective rewards for positional games ⋮ Approximation schemes for stochastic mean payoff games with perfect information and few random positions ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms ⋮ Seven things i know about them
Cites Work
This page was built for publication: Extensions of two person zero sum games
