Pages that link to "Item:Q5918702"
From MaRDI portal
The following pages link to On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702):
Displaying 14 items.
- Final decisions, the Nash equilibrium and solvability in games with common knowledge of logical abilities (Q1181755) (← links)
- On the NP-completeness of finding an optimal strategy in games with common payoffs (Q1414388) (← links)
- On computational complexity of membership test in flow games and linear production games (Q1414436) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564) (← links)
- On the Complexity of Nash Equilibria and Other Fixed Points (Q3068643) (← links)
- A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. (Q4601869) (← links)
- (Q5365135) (← links)
- The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
- Beyond the Existential Theory of the Reals (Q6489317) (← links)
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games (Q6546277) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
