Pages that link to "Item:Q329276"
From MaRDI portal
The following pages link to Approximate well-supported Nash equilibria below two-thirds (Q329276):
Displaying 17 items.
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- On the approximation performance of fictitious play in finite games (Q378343) (← 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)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005) (← links)
- On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- (Q4910938) (redirect page) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- A Metaheuristic Approach to Compute Pure Nash Equilibria (Q5111130) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games (Q6075856) (← links)
