Pages that link to "Item:Q1414826"
From MaRDI portal
The following pages link to On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826):
Displaying 13 items.
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Chess-like games may have no uniform Nash equilibria even in mixed strategies (Q457857) (← links)
- Acyclicity of improvements in finite game forms (Q532517) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- On acyclicity of games with cycles (Q708338) (← links)
- Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic \(c\)-games on networks (Q877607) (← links)
- An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension (Q882601) (← links)
- Equilibria in nonantagonistic positional games on graphs and searching for them (Q1642049) (← links)
- A three-person deterministic graphical game without Nash equilibria (Q1752440) (← links)
- Monotone bargaining is Nash-solvable (Q1801037) (← 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)
- (Q5089213) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
