iBundle: An Efficient Ascending Price Bundle Auction
MetadataShow full item record
CitationParkes, David C. 1999. iBundle: An efficient ascending price bundle auction. In Proceedings of the ACM Conference on Electronic Commerce (EC'99): November 3-5, 1999, Denver, Colorado, ed. S. Feldman, and ACM Special Interest Group on Electronic Commerce, 148-157. New York: ACM Press.
AbstractStandard auction mechanisms often break down in important e-commerce applications, where agents demand bundles of complementary resources, i.e. "I only want B if I also get A". This paper describes iBundle, an ascending-price auction that is guaranteed to compute optimal bundle allocations with agents that follow a best-response bidding strategy. The auction prices bundles directly and allows agents to place additive or exclusive-or bids over collections of bundles. Empirical results confirm that iBundle generates efficient allocations for hard resource allocation problems. Furthermore, we shoe that iBundle generates solutions without complete revelation (or computation) of agent preferences.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4101025
- FAS Scholarly Articles 
Contact administrator regarding this item (to report mistakes or request changes)