Learning valuation distributions from partial observations

12Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

Auction theory traditionally assumes that bidders' valuation distributions are known to the auctioneer, such as in the celebrated, revenue-optimal Myerson auction (Myerson 1981). However, this theory does not describe how the auctioneer comes to possess this information. Recently work (Cole and Roughgarden 2014) showed that an approximation based on a finite sample of independent draws from each bidder's distribution is sufficient to produce a near-optimal auction. In this work, we consider the problem of learning bidders' valuation distributions from much weaker forms of observations. Specifically, we consider a setting where there is a repeated, sealed-bid auction with n bidders, but all we observe for each round is who won, but not how much they bid or paid. We can also participate (i.e., submit a bid) ourselves, and observe when we win. From this information, our goal is to (approximately) recover the inherently recoverable part of the underlying bid distributions. We also consider extensions where different subsets of bidders participate in each round, and where bidders' valuations have a common-value component added to their independent private values.

Cite

CITATION STYLE

APA

Blum, A., Mansour, Y., & Morgenstern, J. (2015). Learning valuation distributions from partial observations. In Proceedings of the National Conference on Artificial Intelligence (Vol. 2, pp. 798–804). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9301

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