Optimal combinatorial mechanism design
AbstractWe consider an optimal mechanism design problem with several heterogenous 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 the 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 using the techniques of supermodular optimization. Copyright Springer-Verlag 2013
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 Springer in its journal Economic Theory.
Volume (Year): 53 (2013)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm
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
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.:
- Fernando Branco, 1996. "Multiple unit auctions of an indivisible good," Economic Theory, Springer, vol. 8(1), pages 77-101.
- Milgrom, Paul & Shannon, Chris, 1994.
"Monotone Comparative Statics,"
Econometric Society, vol. 62(1), pages 157-80, January.
- 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.
- Motty Perry & Philip J. Reny, 2002. "An Efficient Auction," Econometrica, Econometric Society, vol. 70(3), pages 1199-1212, May.
- 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.
- Krishna, Vijay & Maenner, Eliot, 2001. "Convex Potentials with an Application to Mechanism Design," Econometrica, Econometric Society, vol. 69(4), pages 1113-19, July.
- Levin, Jonathan, 1997. "An Optimal Auction for Complements," Games and Economic Behavior, Elsevier, vol. 18(2), pages 176-192, February.
- Krishna, Vijay, 2003. "Asymmetric English auctions," Journal of Economic Theory, Elsevier, vol. 112(2), pages 261-288, October.
- Eric Maskin & John Riley, 1984. "Monopoly with Incomplete Information," RAND Journal of Economics, The RAND Corporation, vol. 15(2), pages 171-196, Summer.
- 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.
- 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).
- Hitoshi Matsushima, 2012. "Optimal Multiunit Exchange Design with Single-Dimensionality," CARF F-Series CARF-F-292, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo, revised Sep 2012.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
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.