Single and Multi-Dimensional Optimal Auctions - A Network Approach
This 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.
|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
|Order Information:|| Email: |
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.:
- Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
- 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.
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1397. 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: (Fran Walker)
If references are entirely missing, you can add them using this form.