BA Mayer, E Sodomka, A Greenwald, and MP Wellman

14th ACM Conference on Electronic Commerce, pages 679–696, June 2013.


Current autonomous bidding strategies for complex auctions typically employ a two phased architecture: first, the agent predicts a distribution over good prices, and then the agent
generates bids given those predictions, usually using a heuristic. For computational reasons, previous state-of-the-art methods assumed prices were independent across goods, and then bid based on marginal price distributions. However, prices for goods are typically dependent, especially for complements and substitutes. We examine and bound the potential error from bidding with respect to marginal price distributions when good prices are in fact correlated. Then, to mitigate this error, we develop computationally feasible methods for predicting joint price distributions, and employing such predictions in bidding strategies. We also demonstrate experimentally that the state-of-the-art heuristic for bidding in simultaneous second-price sealed-bid auctions is outdone by the analog of this same heuristic bidding with respect to joint instead of marginal price predictions.


ACM DL Author-ize serviceAccounting for price dependencies in simultaneous sealed-bid auctions

Brandon A. Mayer, Eric Sodomka, Amy Greenwald, Michael Wellman
EC ’13 Proceedings of the fourteenth ACM conference on Electronic commerce, 2013