Publication:2934593
From MaRDI portal
zbMath1303.91009MaRDI QIDQ2934593
Xi Chen, Paul Valiant, Shang-Hua Teng
Publication date: 18 December 2014
68Q25: Analysis of algorithms and problem complexity
91A05: 2-person games
68W25: Approximation algorithms
Related Items
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games, A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games, Public goods games in directed networks, Recent development in computational complexity characterization of Nash equilibrium, Equilibria, fixed points, and complexity classes, The myth of the folk theorem, Simulating cardinal preferences in Boolean games: a proof technique, Parameterized two-player Nash equilibrium, The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values, The complexity of computational problems about Nash equilibria in symmetric win-lose games, Some Tractable Win-Lose Games