From Optimization to Satisficing: Robust Screening under Distributional Ambiguity
Shumin Ma, Daniel Zhuoyu Long, Lijian Lu

TL;DR
This paper introduces a robust satisficing framework for screening under distributional ambiguity, focusing on achieving revenue targets and improving fairness compared to traditional robust optimization methods.
Contribution
The study develops a tractable robust satisficing approach with randomized pricing, providing a new alternative to robust optimization for handling distributional uncertainty.
Findings
RS improves buyer surplus with increasing hazard rate distributions.
RS enhances out-of-sample seller revenue with positively skewed valuations.
The approach offers a practical alternative to traditional robust optimization methods.
Abstract
This study investigates a robust screening problem under distributional ambiguity, where a seller is uncertain about a buyer's true valuation distribution, knowing only that it lies near a reference distribution measured by the Wasserstein metric. Traditional robust optimization (RO) approaches prioritize maximizing worst-case revenue within predefined ambiguity sets, often yielding seller-centric outcomes and reliance on precise set specifications. We propose a robust satisficing (RS) framework aimed at attaining a specified revenue target by minimizing the worst-case shortfall across all potential distributions. Our approach offers a tractable formulation and detailed characterization of optimal mechanisms using randomized pricing strategies. We also assess the out-of-sample efficacy of a simple posted pricing mechanism, finding it particularly effective with lower targets and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
