The following pages link to (Q4695866):
Displaying 5 items.
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826) (← links)
- Monotone bargaining is Nash-solvable (Q1801037) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
