Readfeed

Grant Schoenebeck

  • The computational complexity of finding Nash equilibria in succinctly represented gamesThe computational complexity of finding Nash equilibria in succinctly represented games