The approximation complexity of win-lose games
From MaRDI portal
Recommendations
Cited in
(20)- Games, complexity classes, and approximation algorithms.
- Computational complexity of winning strategies in two-person polynomial games
- Simulating cardinal preferences in Boolean games: a proof technique
- 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
- Playing Games with Approximation Algorithms
- scientific article; zbMATH DE number 29719 (Why is no real title available?)
- Recent development in computational complexity characterization of Nash equilibrium
- Equilibria, fixed points, and complexity classes
- The complexity of decision problems about Nash equilibria in 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
- Beyond the worst case: semi-random complexity analysis of winner determination
- Complexity of equilibria in first-price auctions under general tie-breaking rules
- Complexity and parametric computation of equilibria in atomic splittable congestion games via weighted block Laplacians
- Nash equilibria of two-player matrix games repeated until collision
- A polynomial-time algorithm for 1/3-approximate Nash equilibria in bimatrix games
- The myth of the folk theorem
This page was built for publication: The approximation complexity of win-lose games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934593)
