An efficient approximate allocation algorithm for combinatorial auctions

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Edo Zurel The Hebrew University of Jerusalem, Israel
Noam Nisan The Hebrew University of Jerusalem, Israel
Published in:
Cover Image
 
· Proceeding
EC '01 Proceedings of the 3rd ACM conference on Electronic Commerce
Pages 125-136
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-387-1 doi>10.1145/501158.501172
An efficient approximate allocation algorithm for combinatorial auctions Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 22
· Downloads (cumulative): 369
· Citation Count: 37


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