Pages that link to "Item:Q1041233"
From MaRDI portal
The following pages link to New algorithms for approximate Nash equilibria in bimatrix games (Q1041233):
Displaying 26 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)
- 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)
- Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← 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)
- An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005) (← 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)
- On Nash-Equilibria of Approximation-Stable Games (Q3162509) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- Approximate Nash Equilibria for Multi-player Games (Q5459991) (← 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)
