Management Science· 2026Q1
Robust Auction Design with Support Information
- 1citations
- Q1SCImago
- 2026year
Short summary
A new auction mechanism, the 'pooling auction' (POOL), is optimal when buyer valuations' lower bound is high relative to their upper bound, outperforming standard second-price auctions (SPA) for robust revenue maximization.
AI-generated from the title and abstract; the full text is not read.
Key points
- Introduces pooling auctions (POOL) as a new class of robust mechanisms for sellers with unknown buyer valuation distributions.
- The optimal mechanism (SPA, POOL, or a mix) depends on three regimes determined by the ratio of the support's lower bound (a) to upper bound (b).
- POOL is optimal when a/b is high, allocating to the highest bidder only above a threshold, otherwise randomly pooling buyers.
- Standard mechanisms are shown to be suboptimal for robustness, necessitating deviations like POOL.
- Results hold for various distribution classes including i.i.d., mixture of i.i.d., and exchangeable/affiliated distributions.
AI-generated from the title and abstract; the full text is not read.
Abstract
A seller wants to sell an item to n buyers. Buyer valuations are independent and identically distributed (i.i.d.) according to a distribution unknown to the seller; the seller only knows that the support is included in [a, b]. To be robust, the seller chooses a dominant strategy incentive compatible mechanism that optimizes the worst-case performance relative to the ideal expected revenue the seller could have collected with knowledge of buyers’ valuations. Our analysis unifies the regret and the ratio objectives. For these objectives, we derive an optimal mechanism and the corresponding performance in quasi-closed form, as a function of the support information [a, b] and the number of buyers n. Our analysis reveals three regimes of support information and a new class of robust mechanisms. (i) When a/b is below a threshold, the optimal mechanism is a second-price auction (SPA) with random reserve, a focal class in earlier literature. (ii) When a/b is above another threshold, SPAs are strictly suboptimal, and an optimal mechanism belongs to a class of mechanisms we introduce, which we call pooling auctions (POOL); whenever the highest value is above a threshold, the mechanism still allocates to the highest bidder, but otherwise the mechanism allocates to a uniformly random buyer, that is, pools low types. (iii) When a/b is between two thresholds, a randomization between SPA and POOL is optimal. We also characterize optimal mechanisms within nested central subclasses of mechanisms: standard mechanisms that only allocate to the highest bidder, SPA with random reserve, and SPA with no reserve. We show strict separations in terms of performance across classes, implying that deviating from standard mechanisms is necessary for robustness. Lastly, we show that the same results hold under other distribution classes that capture “positive dependence,” namely i.i.d., mixture of i.i.d., and exchangeable and affiliated distributions, as well as i.i.d. regular distributions. This paper was accepted by David Simchi-Levi, revenue management and market analytics. Supplemental Material: The online appendices are available at https://doi.org/10.1287/mnsc.2023.02703 .
The authors' abstract, as published at the source. Management Science, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Management Science and Operations Research
Management Science and Operations ResearchDecision Sciences