Fast Complete Algorithm for Multiplayer Nash Equilibrium

Nash equilibrium is the central solution concept in game theory. While a Nash equilibrium can be computed in polynomial time for two-player zero-sum games, it is PPAD-hard for two-player general-sum and multiplayer games and widely believed that no efficient algorithms exist [7, 8, 9]. Furthermore, even if we were able to compute an equilibrium for these game classes, it would have no performance guarantee.