The following pages link to Deterministic graphical games (Q2277168):
Displaying 11 items.
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- Cycles in extensive form perfect information games (Q1176957) (← 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)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- Deterministic Graphical Games Revisited (Q5900106) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
- On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations (Q6573335) (← links)
- Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies (Q6581883) (← links)
