Optimal Combinatorial Mechanism Design
AbstractWe consider an optimal mechanism design problem with several heterogeneous objects and interdependent values. We characterize ex post incentives using an appropriate monotonicity condition and reformulate the problem in such a way that the choice of an allocation rule can be separated from the choice of the payment rule. Central to our analysis is the formulation of a regularity condition, which gives a recipe for the optimal mechanism. If the problem is regular, then an optimal mechanism can be obtained by solving a combinatorial allocation problem in which objects are allocated in a way to maximize the sum of "virtual" valuations. We identify conditions that imply regularity for two nonnested environments using the techniques of supermodular optimization.
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.
Bibliographic InfoPaper provided by Centro de Investigacion Economica, ITAM in its series Working Papers with number 0903.
Length: 42 pages
Date of creation: Feb 2009
Date of revision:
Other versions of this item:
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D60 - Microeconomics - - Welfare Economics - - - General
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-03-14 (All new papers)
- NEP-CDM-2009-03-14 (Collective Decision-Making)
- NEP-CTA-2009-03-14 (Contract Theory & Applications)
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.:
- Monteiro, Paulo Klinger, 1999.
"Optimal Auctions in a General Model of Identical Goods,"
Economics Working Papers (Ensaios Economicos da EPGE)
358, FGV/EPGE Escola Brasileira de Economia e Finanças, Getulio Vargas Foundation (Brazil).
- Monteiro, Paulo Klinger, 2002. "Optimal auctions in a general model of identical goods," Journal of Mathematical Economics, Elsevier, vol. 37(1), pages 71-79, February.
- Motty Perry & Philip J. Reny, 2002. "An Efficient Auction," Econometrica, Econometric Society, vol. 70(3), pages 1199-1212, May.
- Krishna, Vijay & Maenner, Eliot, 2001. "Convex Potentials with an Application to Mechanism Design," Econometrica, Econometric Society, vol. 69(4), pages 1113-19, July.
- Lawrence M. Ausubel & Peter Cramton, 1998. "The Optimality of Being Efficient," Papers of Peter Cramton 98wpoe, University of Maryland, Department of Economics - Peter Cramton, revised 18 Jun 1999.
- Eric Maskin & John Riley, 1984. "Monopoly with Incomplete Information," RAND Journal of Economics, The RAND Corporation, vol. 15(2), pages 171-196, Summer.
- Milgrom, Paul & Shannon, Chris, 1994.
"Monotone Comparative Statics,"
Econometric Society, vol. 62(1), pages 157-80, January.
- Krishna, Vijay, 2003. "Asymmetric English auctions," Journal of Economic Theory, Elsevier, vol. 112(2), pages 261-288, October.
- Cremer, Jacques & McLean, Richard P, 1985. "Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent," Econometrica, Econometric Society, vol. 53(2), pages 345-61, March.
- Levin, Jonathan, 1997. "An Optimal Auction for Complements," Games and Economic Behavior, Elsevier, vol. 18(2), pages 176-192, February.
- Fernando Branco, 1996. "Multiple unit auctions of an indivisible good," Economic Theory, Springer, vol. 8(1), pages 77-101.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Diego Dominguez).
If references are entirely missing, you can add them using this form.