An Options-Based Method to Solve the Composability Problem in Sequential Auctions

DSpace/Manakin Repository

An Options-Based Method to Solve the Composability Problem in Sequential Auctions

Citable link to this page

. . . . . .

Title: An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Author: Juda, Adam I.; Parkes, David C.

Note: Order does not necessarily reflect citation order of authors.

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.
Full Text & Related Files:
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.
Published Version: doi:10.1007/11575726_4
Other Sources: http://www.eecs.harvard.edu/econcs/pubs/options_lnai.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4000815

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7501]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters