|
EconStor >
Northwestern University >
Kellogg School of Management - Center for Mathematical Studies in Economics and Management Science, Northwestern University >
Discussion Papers, Kellogg School of Management, Northwestern University >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10419/31166
|
| | |
| Title: | | Single and multi-dimensional optimal auctions: a network approach  |
| Authors: | | Malakhov, Alexey Vohra, Rakesh V. |
| Issue Date: | | 2004 |
| Series/Report no.: | | Discussion paper // Center for Mathematical Studies in Economics and Management Science 1397 |
| Abstract: | | 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. |
| Subjects: | | Auctions Networks Linear Programming |
| JEL: | | C61 C70 D44 |
| Document Type: | | Working Paper |
| Appears in Collections: | | Discussion Papers, Kellogg School of Management, Northwestern University
|
| |
| | |
Download bibliographical data as:
BibTeX
|
| |
Share on:http://hdl.handle.net/10419/31166
|
Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.
|