Publication:

iBundle: An Efficient Ascending Price Bundle Auction

Loading...
Thumbnail Image

Date

1999

Published Version

Journal Title

Journal ISSN

Volume Title

Publisher

Association for Computing Machinery
The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

Parkes, 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.

Abstract

Standard 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.

Description

Research Data

Keywords

agent-mediated electronic commerce, bunding problem, iterative auction, price discrimination, resource allocation

Terms of Use

This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service

Endorsement

Review

Supplemented By

Related Stories