IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2505.22862.html
   My bibliography  Save this paper

Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor

Author

Listed:
  • Yeon-Koo Che
  • Andrew B. Choi

Abstract

Allocation of goods and services often involves both stochastic supply and stochastic demand. Motivated by applications such as cloud computing, gig platforms, and blockchain auctions, we study the design of optimal selling mechanisms in an environment where buyers with private valuations arrive stochastically and are assigned goods that also arrive stochastically, and either buyers or goods can be held in a queue at costs until allocation. The optimal mechanism dynamically leverages competitive pressure across time by managing the queue of buyers and inventory of goods, using reserve prices that increase with the number of buyers in the queue and decrease with the number of items in inventory, and an auction to allocate the goods.

Suggested Citation

  • Yeon-Koo Che & Andrew B. Choi, 2025. "Optimal Auction Design for Dynamic Stochastic Environments: Myerson Meets Naor," Papers 2505.22862, arXiv.org, revised May 2025.
    • Handle: RePEc:arx:papers:2505.22862
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2505.22862
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    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:arx:papers:2505.22862. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.