IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v49y2024i2p675-696.html
   My bibliography  Save this article

Large Ranking Games with Diffusion Control

Author

Listed:
  • Stefan Ankirchner

    (Institute for Mathematics, University of Jena, 07743 Jena, Germany)

  • Nabil Kazi-Tani

    (Institut Elie Cartan de Lorraine, Université de Lorraine, L’Unité de Formation et de Recherche Mathématiques Informatique et Mécanique (UFR MIM), 57073 Metz Cedex 03, France)

  • Julian Wendt

    (Institute for Mathematics, University of Jena, 07743 Jena, Germany)

  • Chao Zhou

    (Department of Mathematics and Risk Management Institute, National University of Singapore, 119076, Singapore)

Abstract

We consider a symmetric stochastic differential game where each player can control the diffusion intensity of an individual dynamic state process, and the players whose states at a deterministic finite time horizon are among the best α ∈ ( 0 , 1 ) of all states receive a fixed prize. Within the mean field limit version of the game, we compute an explicit equilibrium, a threshold strategy that consists of choosing the maximal fluctuation intensity when the state is below a given threshold and the minimal intensity otherwise. We show that for large n , the symmetric n -tuple of the threshold strategy provides an approximate Nash equilibrium of the n -player game. We also derive the rate at which the approximate equilibrium reward and the best-response reward converge to each other, as the number of players n tends to infinity. Finally, we compare the approximate equilibrium for large games with the equilibrium of the two-player case.

Suggested Citation

  • Stefan Ankirchner & Nabil Kazi-Tani & Julian Wendt & Chao Zhou, 2024. "Large Ranking Games with Diffusion Control," Mathematics of Operations Research, INFORMS, vol. 49(2), pages 675-696, May.
  • Handle: RePEc:inm:ormoor:v:49:y:2024:i:2:p:675-696
    DOI: 10.1287/moor.2023.1373
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2023.1373
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2023.1373?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
    ---><---

    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:inm:ormoor:v:49:y:2024:i:2:p:675-696. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.