scientific article; zbMATH DE number 3542195
From MaRDI portal
Publication:4117607
zbMath0347.90069MaRDI QIDQ4117607
Publication date: 1976
Full work available at URL: http://www.numdam.org/item?id=MSMF_1976__45__5_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Two-person game forms guaranteeing the stability against commitment and delaying tactics ⋮ The complexity of mean payoff games on graphs ⋮ A potential reduction algorithm for two-person zero-sum mean payoff stochastic games ⋮ A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games ⋮ On canonical forms for zero-sum stochastic mean payoff games ⋮ 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 ⋮ 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 ⋮ Acyclicity of improvements in finite game forms ⋮ Extensions of two person zero sum games ⋮ On Nash Equilibria in Stochastic Positional Games with Average Payoffs
Cites Work
This page was built for publication:
