Constant Rank Two-Player Games are PPAD-hard.
SIAM JOURNAL ON COMPUTING, no. 5 (2018): 1858.0-1887.0
Finding a Nash equilibrium in a two-player normal form game (2-Nash) is one of the most extensively studied problems within mathematical economics as well as theoretical computer science. Such a game can be represented by two payoff matrices A and B, one for each player. 2-Nash is PPAD-complete in general, while in the case of zero-sum ga...More
Full Text (Upload PDF)
PPT (Upload PPT)