← Search

Sam Taggart

2 accepted papers

2019

Learning Auctions with Robust Incentive Guarantees

NeurIPS 2019poster

We study the problem of learning Bayesian-optimal revenue-maximizing auctions. The classical approach to maximizing revenue requires a known prior distribution on the demand of the bidders, although recent work has shown how to replace the knowledge of a prior distribution with a polynomial sample.…

Cited by 29SourcePDFScholar