The following pages link to (Q4117607):
Displayed 9 items.
- 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)
- Two-person game forms guaranteeing the stability against commitment and delaying tactics (Q1893192) (← links)