The following pages link to (Q2934593):
Displaying 15 items.
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- The myth of the folk theorem (Q993783) (← links)
- Games, complexity classes, and approximation algorithms. (Q1126837) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Some Tractable Win-Lose Games (Q3010417) (← links)
- Playing Games with Approximation Algorithms (Q3575160) (← links)
- (Q3984859) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- Public goods games in directed networks (Q6102516) (← links)
- Beyond the worst case: semi-random complexity analysis of winner determination (Q6167260) (← links)
