Approximately-strategyproof and tractable multi-unit auctions

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Anshul Kothar University of California at Santa Barbara, CA
David C. Parke Harvard University, Cambridge, MA
Subhash Sur University of California at Santa Barbara, CA
Published in:
Cover Image
 
· Proceeding
EC '03 Proceedings of the 4th ACM conference on Electronic commerce
Pages 166-175
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-679-X doi>10.1145/779928.779948
Approximately-strategyproof and tractable multi-unit auctions Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 9
· Downloads (cumulative): 335
· Citation Count: 20


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