Maximizing Revenue under Market Shrinkage and Market Uncertainty
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm
Abstract
A shrinking market is a ubiquitous challenge faced by various industries. In this paper we formulate the first formal model of shrinking markets in multi-item settings, and study how mechanism design and machine learning can help preserve revenue in an uncertain, shrinking market. Via a sample-based learning mechanism, we prove the first guarantees on how much revenue can be preserved by truthful multi-item, multi-bidder auctions (for limited supply) when only a random unknown fraction of the population participates in the market. We first present a general reduction that converts any sufficiently rich auction class into a randomized auction robust to market shrinkage. Our main technique is a novel combinatorial construction called a winner diagram that concisely represents all possible executions of an auction on an uncertain set of bidders. Via a probabilistic analysis of winner diagrams, we derive a general possibility result: a sufficiently rich class of auctions always contains an auction that is robust to market shrinkage and market uncertainty. Our result has applications to important practically-constrained settings such as auctions with a limited number of winners. We then show how to efficiently learn an auction that is robust to market shrinkage by leveraging practically-efficient routines for solving the winner determination problem.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 36f30c81-dc33-42d2-8538-a710be723a63Cited by top-tier papers1
Ask how each one uses itRelated papers
- Robust Learning of Optimal AuctionsWenshuo Guo, Michael I. Jordan, Emmanouil ZampetakisNeurIPS 2021 · 4 citations
- Reserve Pricing in Repeated Second-Price Auctions with Strategic BiddersAlexey DrutsaICML 2020 · 17 citations
- Randomized Truthful Auctions with Learning AgentsGagan Aggarwal, Anupam Gupta, Andrés Perlroth, Grigoris VelegkasNeurIPS 2024 · 3 citations
- Learning Optimal Auctions with Correlated Valuations from SamplesChunxue Yang, Xiaohui BeiICML 2021 · 5 citations
- No-Regret Learning in Partially-Informed AuctionsWenshuo Guo, Michael I. Jordan, Ellen VitercikICML 2022 · 10 citations
