Searching for "The complexity of computing a Nash equilibrium." – sorted by Relevance.
-
The complexity of computing a Nash equilibrium
- The Complexity of Computing a Nash Equilibrium Constantinos Daskalakis ∗ Paul W. Goldberg
- Cited by 69 (4 self) – Add To MetaCart
-
The Complexity of Computing a Nash Equilibrium
- The Complexity of Computing a Nash Equilibrium Constantinos Daskalakis ∗ Paul W. Goldberg
- Add To MetaCart
-
Computational-Mechanism Design: A Call to Arms
- -information matrix-form games, the complexity of computing a Nash equilibrium for a two-player, general-sum game—a
- Cited by 36 (5 self) – Add To MetaCart
-
The Complexity of Two-Person Zero-Sum Games in Extensive Form
- drastically. Somework has been done on analyzing the complexity of computing a Nash Equilibrium in general
- Cited by 69 (8 self) – Add To MetaCart
-
Graphical economics
- affair. Indeed, despite decades of effort, the computational complexity of computing a Nash equilibrium
- Cited by 8 (2 self) – Add To MetaCart
-
Trust-based mechanism design
- -information matrix-form games, the complexity of computing a Nash equilibrium for a two-player, general-sum game—a
- Cited by 12 (4 self) – Add To MetaCart
-
Computing the Optimal Strategy to Commit to
- -player normal-form games contrasts with the unknown complexity of computing a Nash equilibrium in such games [21
- Cited by 5 (1 self) – Add To MetaCart
-
Computing Nash equilibria for scheduling on restricted parallel links
- ] guarantees the existence of a Nash equilibrium for any finite game, the complexity of computing a Nash
- Cited by 33 (5 self) – Add To MetaCart

