Pages that link to "Item:Q4601869"
From MaRDI portal
The following pages link to A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. (Q4601869):
Displaying 15 items.
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- (Q5089213) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Approximating the existential theory of the reals (Q5918881) (← links)
- The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
- (Q6124760) (← links)
- The complexity of the Hausdorff distance (Q6145675) (← links)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
