A prior-independent revenue-maximizing auction for multiple additive bidders

15Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recent work by Babaioff et al. [1], Yao [30], and Cai et al. [7] shows how to construct an approximately optimal auction for additive bidders, given access to the priors from which the bidders’ values are drawn. In this paper, building on the single sample approach of Dhangwatnotai et al. [15], we show how the auctioneer can obtain approximately optimal expected revenue in this setting without knowing the priors, as long as the item distributions are regular.

Cite

CITATION STYLE

APA

Goldner, K., & Karlin, A. R. (2016). A prior-independent revenue-maximizing auction for multiple additive bidders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10123 LNCS, pp. 160–173). Springer Verlag. https://doi.org/10.1007/978-3-662-54110-4_12

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