SIGN IN
SIGN UP
The complexity of pure Nash equilibria
Full Text:
PDF
Get this Article
Authors:
Alex Fabrikant
UC Berkeley, CA
Christos Papadimitriou
UC Berkeley, CA
Kunal Talwar
UC Berkeley, CA
Published in:
· Proceeding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pages 604-612
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-852-0
doi>
10.1145/1007352.1007445
2004 Article
Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 86
· Downloads (cumulative): 1,704
· Citation Count: 220
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '17
Share:
|
Author Tags
complexity
congestion games
design and analysis of algorithms
games
local search
pls
pls-completeness
problems, reductions and completeness
pure nash equilibria
theory
Contact Us
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder