Pages that link to "Item:Q2659767"
From MaRDI portal
The following pages link to The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767):
Displaying 10 items.
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- On the complexity of deciding bimatrix games similarity (Q955038) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix (Q1939257) (← links)
- (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions (Q2082560) (← links)
- The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564) (← links)
- (Q3984859) (← links)
- On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games (Q6546277) (← links)
