From convex optimization to randomized mechanisms: toward optimal combinatorial auctions

Full Text: PDFPDF SIGN IN to get this Article
Authors: Shaddin Dughmi Stanford University, Stanford, CA, USA
Tim Roughgarden Stanford University, Stanford, CA, USA
Qiqi Yan Stanford University, Stanford, CA, USA
Published in:
Cover Image
 
· Proceeding
STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing
Pages 149-158
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0691-1 doi>10.1145/1993636.1993657
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 140
· Downloads (cumulative): 262
· Citation Count: 13


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