Advanced Search
MyIDEAS: Login to save this paper or follow this series

Single and Multi-Dimensional Optimal Auctions - A Network Approach

Contents:

Author Info

  • Alexey Malakhov
  • Rakesh V. Vohra
Registered author(s):

    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.

    Download Info

    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.
    File URL: http://www.kellogg.northwestern.edu/research/math/papers/1397.pdf
    File Function: main text
    Download Restriction: no

    Bibliographic Info

    Paper provided by Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1397.

    as in new window
    Length:
    Date of creation: Jul 2004
    Date of revision:
    Handle: RePEc:nwu:cmsems:1397

    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
    Phone: 847/491-3527
    Fax: 847/491-2530
    Email:
    Web page: http://www.kellogg.northwestern.edu/research/math/
    More information through EDIRC

    Order Information:
    Email:

    Related research

    Keywords: Auctions; Networks; Linear Programming;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    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.:
    as in new window
    1. Jean-Charles Rochet & Philippe Chone, 1998. "Ironing, Sweeping, and Multidimensional Screening," Econometrica, Econometric Society, vol. 66(4), pages 783-826, July.
    2. 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.
    3. Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Müller,Rudolf & Perea,Andrés & Wolf,Sascha, 2005. "Weak Monotonicity and Bayes-Nash Incentive Compatibility," Research Memorandum 039, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. 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.
    4. 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.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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 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.