Pages that link to "Item:Q2931371"
From MaRDI portal
The following pages link to The complexity of computing a Nash equilibrium (Q2931371):
Displayed 14 items.
- (Q4638083) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- The Complexity of Nash Equilibria in Infinite Multiplayer Games (Q5458348) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Approximate Equilibria for Strategic Two Person Games (Q5459968) (← links)
- The Local and Global Price of Anarchy of Graphical Games (Q5459989) (← links)
- Approximate Nash Equilibria for Multi-player Games (Q5459991) (← links)
- Price-based protocols for fair resource allocation (Q5501959) (← links)
- The truth behind the myth of the folk theorem (Q5892456) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games (Q6075856) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)