@inproceedings{8e4780cab4f14406bec5e008e4f69d2e,

title = "Selling to a no-regret buyer",

abstract = "We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution D in every round). Prior work assumes that the buyer is fully rational and will perfectly reason about how their bids today affect the seller's decisions tomorrow. In this work we initiate a different direction: the buyer simply runs a no-regret learning algorithm over possible bids. We provide a fairly complete characterization of optimal auctions for the seller in this domain. Specifically: • If the buyer bids according to EXP3 (or any “mean-based” learning algorithm), then the seller can extract expected revenue arbitrarily close to the expected welfare. This auction is independent of the buyer's valuation D, but somewhat unnatural as it is sometimes in the buyer's interest to overbid. • There exists a learning algorithm A such that if the buyer bids according to A then the optimal strategy for the seller is simply to post the Myerson reserve for D every round. • If the buyer bids according to EXP3 (or any “mean-based” learning algorithm), but the seller is restricted to “natural” auction formats where overbidding is dominated (e.g. Generalized First-Price or Generalized Second-Price), then the optimal strategy for the seller is a pay-your-bid format with decreasing reserves over time. Moreover, the seller's optimal achievable revenue is characterized by a linear program, and can be unboundedly better than the best truthful auction yet simultaneously unboundedly worse than the expected welfare.",

keywords = "Auctions, Mechanism design, Multi-armed bandits, No-regret learning",

author = "Mark Braverman and Jieming Mao and Jon Schneider and Matt Weinberg",

year = "2018",

month = jun,

day = "11",

doi = "10.1145/3219166.3219233",

language = "English (US)",

series = "ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation",

publisher = "Association for Computing Machinery, Inc",

pages = "523--538",

booktitle = "ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation",

note = "19th ACM Conference on Economics and Computation, EC 2018 ; Conference date: 18-06-2018 Through 22-06-2018",

}