Optimal Design for Multi-Item Auctions: A Robust Optimization Approach: The Robust Optimal Mechanism Is Incentive Compatible, Budget Feasible and Individually RationalResearch Paper
Designing a revenue-maximizing auction for several items is hard once buyers have budgets. Myerson's optimal auction (Myerson 1981) solves the single-item problem without budgets, under a known prior on the buyers' values. With several items, correlated values or budget constraints, no comparable characterization is known, and the Bayesian formulation…