Pages that link to "Item:Q2268119"
From MaRDI portal
The following pages link to Simple complexity from imitation games (Q2268119):
Displaying 14 items.
- A repeated imitation model with dependence between stages: decision strategies and rewards (Q747545) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Games in oriented matroids (Q924938) (← links)
- The complexity of equilibria: Hardness results for economies via a correspondence with games (Q959811) (← links)
- Imitation games and computation (Q993779) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- Oriented Euler complexes and signed perfect matchings (Q2340282) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- (Q2861535) (← links)
- Settling Some Open Problems on 2-Player Symmetric Nash Equilibria (Q3449600) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
