The following pages link to (Q4117607):
Displayed 17 items.
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Acyclicity of improvements in finite game forms (Q532517) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Extensions of two person zero sum games (Q1234640) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Two-person game forms guaranteeing the stability against commitment and delaying tactics (Q1893192) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← links)
- A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
- On Nash Equilibria in Stochastic Positional Games with Average Payoffs (Q5270512) (← links)