Pages that link to "Item:Q5919609"
From MaRDI portal
The following pages link to The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609):
Displaying 6 items.
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
- (Q5089213) (← links)
- On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702) (← links)
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games (Q6546277) (← links)