IDEAS home Printed from https://ideas.repec.org/a/taf/apmtfi/v31y2024i5p279-311.html
   My bibliography  Save this article

Dynamic Inventory Management with Mean-Field Competition

Author

Listed:
  • Ryan Donnelly
  • Zi Li

Abstract

Agents attempt to maximize expected profits earned by selling multiple units of a perishable product where their revenue streams are affected by the prices they quote as well as the distribution of other prices quoted in the market by other agents. We propose a model which captures this competitive effect and directly analyse the model in the mean-field limit as the number of agents is very large. We classify mean-field Nash equilibrium in terms of the solution to a Hamilton-Jacobi-Bellman equation and a consistency condition and use this to motivate an iterative numerical algorithm. Convergence of this numerical algorithm yields the pricing strategy of a mean-field Nash equilibrium. Properties of the equilibrium pricing strategies and overall market dynamics are then investigated, in particular how they depend on the strength of the competitive interaction and the ability to oversell the product.

Suggested Citation

  • Ryan Donnelly & Zi Li, 2024. "Dynamic Inventory Management with Mean-Field Competition," Applied Mathematical Finance, Taylor & Francis Journals, vol. 31(5), pages 279-311, September.
    • Handle: RePEc:taf:apmtfi:v:31:y:2024:i:5:p:279-311
    DOI: 10.1080/1350486X.2025.2488769
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1350486X.2025.2488769
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/1350486X.2025.2488769?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:taf:apmtfi:v:31:y:2024:i:5:p:279-311. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAMF20 .

    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.