scientific article
From MaRDI portal
Publication:2934593
zbMath1303.91009MaRDI QIDQ2934593
Xi Chen, Paul Valiant, Shang-Hua Teng
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Approximation algorithms (68W25)
Related Items (11)
Simulating cardinal preferences in Boolean games: a proof technique ⋮ The complexity of computational problems about Nash equilibria in symmetric win-lose games ⋮ 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 ⋮ Parameterized two-player Nash equilibrium ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ Equilibria, fixed points, and complexity classes ⋮ Some Tractable Win-Lose Games ⋮ The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values ⋮ The myth of the folk theorem
This page was built for publication:
