The complexity of computing a Nash equilibrium

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Constantinos Daskalakis University of California, Berkeley
Paul W. Goldberg University of Warwick, U.K.
Christos H. Papadimitriou University of California, Berkeley
Published in:
· Proceeding
STOC '06 Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Pages 71 - 78
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-134-1 doi>10.1145/1132516.1132527
The complexity of computing a Nash equilibrium Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 17
· Downloads (12 Months): 240
· Downloads (cumulative): 1,573
· Citation Count: 126


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder