Pages that link to "Item:Q3574301"
From MaRDI portal
The following pages link to An Optimization Approach for Approximate Nash Equilibria (Q3574301):
Displaying 22 items.
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- On the approximation performance of fictitious play in finite games (Q378343) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Lipschitz Continuity and Approximate Equilibria (Q2819444) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- (Q4638112) (← 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)
