Publication: An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Open/View Files
Date
2005
Authors
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Juda, Adam I., and David C. Parkes. 2005. An options-based method to solve the composability problem in sequential auctions. In Agent-Mediated Electronic Commerce VI, ed. P. Faratin, J. A Rodríguez-Aguilar, 44-58. Berlin: Springer. Previously published in Lecture Notes in Computer Science 3435: 44-58.
Research Data
Abstract
Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctions selling the same good, with no dominant bidding strategy in any single auction. Second, bidding agents often need to acquire a bundle of goods by bidding in multiple auctions, again with no dominant bidding strategy in any single auction. This paper introduces an options-based infrastructure that respects the autonomy of individual sellers but still enables bidders to utilize a dominant, truthful strategy across multiple auctions.
Description
Other Available Sources
Keywords
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