The computational complexity of nash equilibria in concisely represented games

Grant Schoenebeck, Salil P. Vadhan. The computational complexity of nash equilibria in concisely represented games. In Joan Feigenbaum, John C.-I. Chuang, David M. Pennock, editors, Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006. pages 270-279, ACM, 2006. [doi]

Abstract

Abstract is missing.