Pages that link to "Item:Q973002"
From MaRDI portal
The following pages link to Well supported approximate equilibria in bimatrix games (Q973002):
Displaying 15 items.
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- On the approximation performance of fictitious play in finite games (Q378343) (← links)
- On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
- A note on anti-Nash equilibrium for bimatrix game (Q2673539) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem (Q5219559) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
