Publication: An Options-Based Solution to the Sequential Auction Problem
Open/View Files
Date
2009
Authors
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Juda, Adam I., and David C. Parkes. 2009. An options-based solution to the sequential auction problem. Artificial Intelligence 173(7-8): 876-899.
Research Data
Abstract
The sequential auction problem is commonplace in open, electronic marketplaces such as eBay. This is the problem where a buyer has no dominant strategy in bidding across multiple auctions when the buyer would have a simple, truth-revealing strategy if there was but a single auction event. Our model allows for multiple, distinct goods and market dynamics with buyers and sellers that arrive over time. Sellers each bring a single unit of a good to the market while buyers can have values on bundles of goods. We model each individual auction as a second-price (Vickrey) auction and propose an options-based, proxied solution to provide price and winner-determination coordination across auctions. While still allowing for temporally uncoordinated market participation, this options-based approach solves the sequential auction problem and provides truthful bidding as a weakly dominant strategy for buyers. An empirical study suggests that this coordination can enable a significant efficiency and revenue improvement over the current eBay market design, and highlights the effect on performance of complex buyer valuations (buyers with substitutes and complements valuations) and varying the market liquidity.
Description
Other Available Sources
Keywords
coordination problems, preferences, dynamic auctions, proxy agents, options, strategyproofness, electronic markets
Terms of Use
This article is made available under the terms and conditions applicable to Open Access Policy Articles (OAP), as set forth at Terms of Service