Fast convergence to nearly optimal solutions in potential games

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Baruch Awerbuch Johns Hopkins University, Baltimore, MD, USA
Yossi Azar Tel-Aviv University, Tel-Aviv, Israel
Amir Epstein Tel-Aviv University, Tel-Aviv, Israel
Vahab Seyed Mirrokni Mi rosoft Research, Redmond, WA, USA
Alexander Skopalik RWTH Aachen, Aachen, Germany
Fast convergence to nearly optimal solutions in potential games Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 32
· Downloads (cumulative): 310
· Citation Count: 28

Published in:
Cover Image
 
· Proceeding
EC '08 Proceedings of the 9th ACM conference on Electronic commerce
Pages 264-273
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-169-9 doi>10.1145/1386790.1386832

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