Asymptotically optimal algorithm for stochastic adwords

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Nikhil R. Devanur Microsoft Research, Redmond, WA, USA
Balasubramanian Sivan University of Wisconsin-Madison, Madison, WI, USA
Yossi Azar Tel-Aviv University, Tel-Aviv, Israel
Published in:
Cover Image
 
· Proceeding
EC '12 Proceedings of the 13th ACM Conference on Electronic Commerce
Pages 388-404
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1415-2 doi>10.1145/2229012.2229043
Asymptotically optimal algorithm for stochastic adwords Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 57
· Downloads (cumulative): 57
· Citation Count: 0


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