Skip to content
DraconiticResearch
Search Sources API
174,684 studies31 sourcesUpdated 44 min ago
PreprintarXiv licencearXiv

A multi-player optimal stopping game based on a spider Brownian motion

Abstract

This paper studies a multi-player non-zero-sum optimal stopping game driven by a spider Brownian motion. We study a specific, tractable family of games and the focus is on the existence and uniqueness of subgame-perfect Nash equilibria (SPNE). We begin by analyzing the two-player setting, in which the underlying process is a skew Brownian motion, and establish sufficient conditions for the existence of an SPNE. We then derive sufficient conditions for the uniqueness of the SPNE in the symmetric case, (where the skew Brownian motion reduces to a standard Brownian motion and both players have the same payoff structures). We also give examples which show that there can be multiple SPNE or no SPNE. We then extend the framework to the multi-player setting and provide sufficient conditions for the existence of an SPNE in this more general setting with a spider Brownian motion.

Related

  1. Necessary and sufficient conditions for optimal control of coupled forward-backward stochastic control systems driven by G-Brownian motion
    Xiaojuan Li, Mingshang Hu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Optimal Liquidation with Support and Resistance Levels under Multi-Skew Brownian Motion
    Jun Maeda
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  3. Boundary behavior and optimal pointwise Hölder exponent of the total local time of (1+β)-stable super-Brownian motion
    Jieliang Hong, Du Yang, Junyan Zhang
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  4. Optimal Tail Estimates for Differential Equations Driven by Fractional Brownian Motion
    Horatio Boedihardjo, Xi Geng, Sheng Wang
    arXivPreprintCC0Full textAnalysis & PDEsProbabilityarXiv
  5. PERSISTENCE OF THE WIENER SAUSAGE: SAMPLING STABILITY AND LIMIT THEOREMS FOR BETTI-CURVE FUNCTIONALS OF DRIFTED PLANAR BROWNIAN MOTION
    Tristan Guillaume
    HALPreprintPublisher termsFull textProbabilityHAL
BibTeX
@misc{hobson2026multiplayer,
  title = {{A multi-player optimal stopping game based on a spider Brownian motion}},
  author = {David Hobson and Jingfei Liu},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2607.22416},
  eprint = {2607.22416},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.22416},
}
RIS
TY  - UNPB
TI  - A multi-player optimal stopping game based on a spider Brownian motion
AU  - David Hobson
AU  - Jingfei Liu
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2607.22416
UR  - https://arxiv.org/abs/2607.22416
AB  - This paper studies a multi-player non-zero-sum optimal stopping game driven by a spider Brownian motion. We study a specific, tractable family of games and the focus is on the existence and uniqueness of subgame-perfect Nash equilibria (SPNE). We begin by analyzing the two-player setting, in which the underlying process is a skew Brownian motion, and establish sufficient conditions for the existence of an SPNE. We then derive sufficient conditions for the uniqueness of the SPNE in the symmetric case, (where the skew Brownian motion reduces to a standard Brownian motion and both players have the same payoff structures). We also give examples which show that there can be multiple SPNE or no SPNE. We then extend the framework to the multi-player setting and provide sufficient conditions for the existence of an SPNE in this more general setting with a spider Brownian motion.
ER  -