Pages that link to "Item:Q3448815"
From MaRDI portal
The following pages link to ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815):
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)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815) (← links)
- A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. (Q4601869) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- (Q5089213) (← links)
- Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm (Q5219680) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← 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)
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games (Q6546277) (← links)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
- A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)