Selling Two Goods Optimally

Abstract

We provide sufficient conditions for revenue maximization in a two-good monopoly where the buyer's values for the items come from independent (but not necessarily identical) distributions over bounded intervals. Under certain distributional assumptions, we give exact, closed-form formulas for the prices and allocation rule of the optimal selling mechanism. As a side result we give the first example of an optimal mechanism in an i.i.d. setting over a support of the form $[0,b]$ which is not deterministic. Since our framework is based on duality techniques, we were also able to demonstrate how slightly relaxed versions of it can still be used to design mechanisms that have very good approximation ratios with respect to the optimal revenue, through a "convexification" process.