Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 15-23
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Approximate Well-Supported Nash Equilibria Below Two-ThirdsLecture Notes in Computer Science, 2012
- New algorithms for approximate Nash equilibria in bimatrix gamesTheoretical Computer Science, 2010
- Settling the complexity of computing two-player Nash equilibriaJournal of the ACM, 2009
- A note on approximate Nash equilibriaTheoretical Computer Science, 2009
- The Complexity of Computing a Nash EquilibriumSIAM Journal on Computing, 2009
- Well Supported Approximate Equilibria in Bimatrix GamesAlgorithmica, 2008
- An Optimization Approach for Approximate Nash EquilibriaInternet Mathematics, 2008
- Nash equilibria in random gamesRandom Structures & Algorithms, 2007
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games2007
- On sparse approximations to randomized strategies and convex combinationsLinear Algebra and its Applications, 1994