IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/1461.html
   My bibliography  Save this paper

Optimal Dynamic Auctions

Author

Listed:
  • Mallesh Pai
  • Rakesh Vohra

Abstract

We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for a unit as well as the time by which she must make the purchase are private information. In this environment, we derive the revenue maximizing Bayesian incentive compatible selling mechanism.

Suggested Citation

  • Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  • Handle: RePEc:nwu:cmsems:1461
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/1461.pdf
    File Function: main text
    Download Restriction: no

    References listed on IDEAS

    as
    1. Border, Kim C, 1991. "Implementation of Reduced Form Auctions: A Geometric Approach," Econometrica, Econometric Society, vol. 59(4), pages 1175-1187, July.
    2. Alexey Malakhov & Rakesh V. Vohra, 2004. "Single and Multi-Dimensional Optimal Auctions - A Network Approach," Discussion Papers 1397, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Armstrong, Mark, 1996. "Multiproduct Nonlinear Pricing," Econometrica, Econometric Society, vol. 64(1), pages 51-75, January.
    4. Simon Board, 2008. "Durable-Goods Monopoly with Varying Demand," Review of Economic Studies, Oxford University Press, vol. 75(2), pages 391-413.
    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


    Cited by:

    1. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    2. Lev, Omer, 2011. "A two-dimensional problem of revenue maximization," Journal of Mathematical Economics, Elsevier, vol. 47(6), pages 718-727.

    More about this item

    Keywords

    dynamic mechanism design; optimal auctions; virtual valuation; revelation principle;

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1461. 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). General contact details of provider: http://edirc.repec.org/data/cmnwuus.html .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.