English

Self-Confirming Price Prediction for Bidding in Simultaneous Ascending Auctions

Computer Science and Game Theory 2012-07-09 v1

Abstract

Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction theory provides little guidance for dealing with this problem. We present a new family of decisiontheoretic bidding strategies that use probabilistic predictions of final prices. We focus on selfconfirming price distribution predictions, which by definition turn out to be correct when all agents bid decision-theoretically based on them. Bidding based on these is provably not optimal in general, but our experimental evidence indicates the strategy can be quite effective compared to other known methods.

Keywords

Cite

@article{arxiv.1207.1400,
  title  = {Self-Confirming Price Prediction for Bidding in Simultaneous Ascending Auctions},
  author = {Anna Osepayshvili and Michael P. Wellman and Daniel Reeves and Jeffrey K. MacKie-Mason},
  journal= {arXiv preprint arXiv:1207.1400},
  year   = {2012}
}

Comments

Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005)