Optimal strategies for bidding agents participating in simultaneous vickrey auctions with perfect substitutes

11Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

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. ©2008 AI Access Foundation. All rights reserved.

Cite

CITATION STYLE

APA

Gerding, E. H., Dash, R. K., Byde, A., & Jennings, N. R. (2008). Optimal strategies for bidding agents participating in simultaneous vickrey auctions with perfect substitutes. Journal of Artificial Intelligence Research, 32, 939–982. https://doi.org/10.1613/jair.2544

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free