Pages that link to "Item:Q5428842"
From MaRDI portal
The following pages link to Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (Q5428842):
Displaying 15 items.
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← 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)
- 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)
- (Q3765577) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- Conditionally Optimal Algorithms for Generalized B\"uchi Games (Q4608584) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Approximate Equilibria for Strategic Two Person Games (Q5459968) (← links)
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games (Q6488585) (← links)