Single and Multi-Dimensional Optimal Auctions - A Network Approach
AbstractThis paper highlights connections between the discrete and continuous approaches to optimal auction design with single and multi-dimensional types. We provide an interpretaion of an optimal auction design problem in terms of a linear program that is an instance of a parametric shortest path problem on a lattice. We also solve some cases explicitly in the discrete framework.
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 Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1397.
Date of creation: Jul 2004
Date of revision:
Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
This paper has been announced in the following NEP Reports:
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.:
- Jean-Charles Rochet & Philippe Chone, 1998. "Ironing, Sweeping, and Multidimensional Screening," Econometrica, Econometric Society, vol. 66(4), pages 783-826, July.
- Rochet, Jean-Charles, 1987. "A necessary and sufficient condition for rationalizability in a quasi-linear context," Journal of Mathematical Economics, Elsevier, vol. 16(2), pages 191-200, April.
- Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
- Müller,Rudolf & Perea,Andrés & Wolf,Sascha, 2005.
"Weak Monotonicity and Bayes-Nash Incentive Compatibility,"
039, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Muller, Rudolf & Perea, Andres & Wolf, Sascha, 2007. "Weak monotonicity and Bayes-Nash incentive compatibility," Games and Economic Behavior, Elsevier, vol. 61(2), pages 344-358, November.
- Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Garud Iyengar & Anuj Kumar, 2008. "Optimal procurement mechanisms for divisible goods with capacitated suppliers," Review of Economic Design, Springer, vol. 12(2), pages 129-154, June.
- Alexey Malakhov & Rakesh Vohra, 2009. "An optimal auction for capacity constrained bidders: a network perspective," Economic Theory, Springer, vol. 39(1), pages 113-128, April.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker).
If references are entirely missing, you can add them using this form.