Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Anand Bhalgat University of Pennsylvania, Philadelphia, PA, USA
Tanmoy Chakraborty University of Pennsylvania, Philadelphia, PA, USA
Sanjeev Khanna University of Pennsylvania, Philadelphia, PA, USA
Published in:
Cover Image
 
· Proceeding
EC '10 Proceedings of the 11th ACM conference on Electronic commerce
Pages 73-82
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-60558-822-3 doi>10.1145/1807342.1807353
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 17
· Downloads (cumulative): 103
· Citation Count: 7


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