Bidding Strategies for Simultaneous Ascending Auctions
dc.contributor.author | Wellman, Michael P. | |
dc.contributor.author | Osepayshvilli, Anna | |
dc.contributor.author | MacKie-Mason, Jeffrey K. | |
dc.contributor.author | Reeves, Daniel M. | |
dc.date.accessioned | 2009-03-18T15:07:12Z | |
dc.date.available | 2009-03-18T15:07:12Z | |
dc.date.issued | 2008 | |
dc.identifier.citation | Michael P. Wellman, Anna Osepayshvili, Jeffrey K. MacKie-Mason, and Daniel Reeves (2008) "Bidding Strategies for Simultaneous Ascending Auctions," The B.E. Journal of Theoretical Economics: Vol. 8: Iss. 1 (Topics), Article 27. http://www.bepress.com/bejte/vol8/iss1/art27 <http://hdl.handle.net/2027.42/61930> | en |
dc.identifier.uri | https://hdl.handle.net/2027.42/61930 | |
dc.description.abstract | Simultaneous ascending auctions present agents with various strategic problems, depending on preference structure. As long as bids represent non-repudiable offers, submitting noncontingent bids to separate auctions entails an exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. With multiple goods (or units of a homogeneous good) bidders also need to account for their own effects on prices. Auction theory does not provide analytic solutions for optimal bidding strategies in the face of these problems. We present a new family of decision-theoretic bidding strategies that use probabilistic predictions of final prices: self-confirming distribution-prediction strategies. Bidding based on these is provably not optimal in general. But evidence using empirical game-theoretic methods we developed indicates the strategy is quite effective compared to other known methods when preferences exhibit complementarities. When preferences exhibit substitutability, simpler demand-reduction strategies address the own price effect problem more directly and perform better. | en |
dc.format.extent | 666476 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | en |
dc.publisher | The Berkeley Electronic Press | en |
dc.subject | Auctions | en |
dc.subject | Mechanism Design | en |
dc.subject | Game Theory | en |
dc.title | Bidding Strategies for Simultaneous Ascending Auctions | en |
dc.type | Article | en |
dc.subject.hlbsecondlevel | Information and Library Science | |
dc.subject.hlbtoplevel | Social Sciences | |
dc.contributor.affiliationum | Information, School of | en |
dc.contributor.affiliationum | Department of Economics | en |
dc.contributor.affiliationumcampus | Ann Arbor | en |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/61930/1/bejte-2008-Bidding Strategies for Simultaneous Ascending Auctions.pdf | |
dc.owningcollname | Information, School of (SI) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.