Pages that link to "Item:Q1234640"
From MaRDI portal
The following pages link to Extensions of two person zero sum games (Q1234640):
Displaying 16 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)
- 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)
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon (Q1132745) (← 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)
- Seven things i know about them (Q2086709) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← 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)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← links)
- On Solving Mean Payoff Games Using Pivoting Algorithms (Q4689394) (← links)
