Optimal strategies for bidding agents participating in simultaneous Vickrey auctions with perfect substitutes
Gerding, Enrico, Dash, Rajdeep, Byde, Andrew and Jennings, Nick (2008) Optimal strategies for bidding agents participating in simultaneous Vickrey auctions with perfect substitutes. Journal of Artificial Intelligence Research, 32, 939-982. (doi:10.1613/jair.2544).
We derive optimal strategies for a bidding agent that participates in multiple, simultaneous second-price auctions with perfect substitutes. We prove that, if everyone else bids locally in a single auction, the global bidder should always place non-zero bids in all available auctions, provided there are no budget constraints. With a budget, however, the optimal strategy is to bid locally if this budget is equal or less than the valuation. Furthermore, for a wide range of valuation distributions, we prove that the problem of finding the optimal bids reduces to two dimensions if all auctions are identical. Finally, we address markets with both sequential and simultaneous auctions, non-identical auctions, and the allocative efficiency of the market.
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||08 Jul 2008 18:27|
|Last Modified:||21 May 2013 13:45|
|Contributors:||Gerding, Enrico (Author)
Dash, Rajdeep (Author)
Byde, Andrew (Author)
Jennings, Nick (Author)
|Date:||8 August 2008|
|Further Information:||Google Scholar|
|ISI Citation Count:||3|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)