An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Juda, Adam I.
MetadataShow full item record
CitationJuda, 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.
AbstractCurrent 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4000815
- FAS Scholarly Articles