Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
The complexity of pure Nash equilibria

Alex Fabrikant, Christos Papadimitriou, and Kunal Talwar

Details

Publication typeInproceedings
Published inSTOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pages604–612
ISBN1-58113-852-0
AddressNew York, NY, USA
PublisherAssociation for Computing Machinery, Inc.
> Publications > The complexity of pure Nash equilibria