We characterize optimal mechanisms for the multiple‐good monopoly problem and provide a framework to find them. We show that a mechanism is optimal if and only if a measure µ derived from the buyer's type distribution satisfies certain stochastic dominance conditions. This measure expresses the marginal change in the seller's revenue under marginal changes in the rent paid to subsets of buyer types. As a corollary, we characterize the optimality of grand‐bundling mechanisms, strengthening several results in the literature, where only sufficient optimality conditions have been derived. As an application, we show that the optimal mechanism for n independent uniform items each supported on [c,c,+1] is a grand‐bundling mechanism, as long as c is sufficiently large, extending Pavlov's result for two items Pavlov, 2011. At the same time, our characterization also implies that, for all c and for all sufficiently large n, the optimal mechanism for n independent uniform items supported on [c,c+1] is not a grand‐bundling mechanism.
MLA
Daskalakis, Constantinos, et al. “Strong Duality for a Multiple-Good Monopolist.” Econometrica, vol. 85, .no 3, Econometric Society, 2017, pp. 735-767, https://doi.org/10.3982/ECTA12618
Chicago
Daskalakis, Constantinos, Alan Deckelbaum, and Christos Tzamos. “Strong Duality for a Multiple-Good Monopolist.” Econometrica, 85, .no 3, (Econometric Society: 2017), 735-767. https://doi.org/10.3982/ECTA12618
APA
Daskalakis, C., Deckelbaum, A., & Tzamos, C. (2017). Strong Duality for a Multiple-Good Monopolist. Econometrica, 85(3), 735-767. https://doi.org/10.3982/ECTA12618
The Executive Committee of the Econometric Society has approved an increase in the submission fees for papers in Econometrica. Starting January 1, 2025, the fee for new submissions to Econometrica will be US$125 for regular members and US$50 for student members.
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.