A two-dimensional problem of revenue maximization
AbstractWe consider the problem of finding the mechanism that maximizes the revenue of a seller of multiple objects. This problem turns out to be significantly more complex than the case where there is only a single object (which was solved by Myerson, 1981). The analysis is difficult even in the simplest case studied here, where there are two exclusive objects and a single buyer, with valuations uniformly distributed on triangular domains. We show that the optimal mechanisms are piecewise linear with either 2 or 3 pieces, and obtain explicit formulas for most cases of interest.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Journal of Mathematical Economics.
Volume (Year): 47 (2011)
Issue (Month): 6 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/jmateco
Auctions; Multi-dimensional mechanism design; Incentive compatibility; Mechanism design;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Manelli, Alejandro M. & Vincent, Daniel R., 2006. "Bundling as an optimal selling mechanism for a multiple-good monopolist," Journal of Economic Theory, Elsevier, vol. 127(1), pages 1-35, March.
- Thanassoulis, John, 2004. "Haggling over substitutes," Journal of Economic Theory, Elsevier, vol. 117(2), pages 217-245, August.
- Manelli, Alejandro M. & Vincent, Daniel R., 2007.
"Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly,"
Journal of Economic Theory,
Elsevier, vol. 137(1), pages 153-185, November.
- Alejandro M. Manelli & Daniel R. Vincent, 2004. "Multidimensional Mechanism Design: Revenue Maximization and the Multiple-Good Monopoly," Working Papers 2004.153, Fondazione Eni Enrico Mattei.
- Blackorby, Charles & Dezsö Szalay, 2007. "Multidimensional Screening, Affiliation, and Full Separation," The Warwick Economics Research Paper Series (TWERPS) 802, University of Warwick, Department of Economics.
- Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Sergiu Hart & Noam Nisan, 2012.
"Approximate Revenue Maximization with Multiple Items,"
Levine's Working Paper Archive
786969000000000433, David K. Levine.
- Sergiu Hart & Noam Nisan, 2012. "Approximate Revenue Maximization with Multiple Items," Discussion Paper Series dp606, The Center for the Study of Rationality, Hebrew University, Jerusalem.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.