Authors
Nikhil R Devanur, Zhiyi Huang, Christos-Alexandros Psomas
Publication date
2016/6/19
Book
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Pages
426-439
Description
Traditionally, the Bayesian optimal auction design problem has been considered either when the bidder values are i.i.d, or when each bidder is individually identifiable via her value distribution. The latter is a reasonable approach when the bidders can be classified into a few categories, but there are many instances where the classification of bidders is a continuum. For example, the classification of the bidders may be based on their annual income, their propensity to buy an item based on past behavior, or in the case of ad auctions, the click through rate of their ads. We introduce an alternate model that captures this aspect, where bidders are a priori identical, but can be distinguished based (only) on some side information the auctioneer obtains at the time of the auction. We extend the sample complexity approach of Dhangwatnotai et al. and Cole and Roughgarden to this model and obtain almost matching upper …
Total citations
20162017201820192020202120222023202481613171416101410
Scholar articles
NR Devanur, Z Huang, CA Psomas - Proceedings of the forty-eighth annual ACM …, 2016