Show simple item record

dc.contributor.authorJuda, Adam I.
dc.contributor.authorParkes, David C.
dc.date.accessioned2010-04-28T16:45:21Z
dc.date.issued2005
dc.identifier.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.en_US
dc.identifier.isbn978-3-540-29737-6en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4000815
dc.description.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.en_US
dc.description.sponsorshipEngineering and Applied Sciencesen_US
dc.language.isoen_USen_US
dc.publisherSpringer Verlagen_US
dc.relation.isversionofdoi:10.1007/11575726_4en_US
dc.relation.hasversionhttp://www.eecs.harvard.edu/econcs/pubs/options_lnai.pdfen_US
dash.licenseLAA
dc.titleAn Options-Based Method to Solve the Composability Problem in Sequential Auctionsen_US
dc.typeMonograph or Booken_US
dc.description.versionAccepted Manuscripten_US
dc.relation.journalLecture Notes in Computer Scienceen_US
dash.depositing.authorParkes, David C.
dc.date.available2010-04-28T16:45:21Z
dc.identifier.doi10.1007/11575726_4*
dash.contributor.affiliatedParkes, David


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record