Optimal combinatorial mechanism design
We 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
If 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.
Volume (Year): 53 (2013)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/199/PS2|
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.:
- Milgrom, P. & Shannon, C., 1991.
"Monotone Comparative Statics,"
11, Stanford - Institute for Thoretical Economics.
- 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, P. K., 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).
- 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.
- 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.
- 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.
- 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.
- Nikolai Kukushkin, 2013. "Monotone comparative statics: changes in preferences versus changes in the feasible set," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 52(3), pages 1039-1060, April.
- Fernando Branco, 1996. "Multiple unit auctions of an indivisible good," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 77-101.
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:53:y:2013:i:2:p:473-498. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.