Finite-player Optimal Stopping Games: Randomization, $\alpha$-potentiality, and Learning
TL;DR
This work introduces an independently randomized formulation in which each stopping rule is represented by an adapted, nondecreasing cumulative stopping process, and identifies an exact-potential subclass with a closed-form threshold equilibrium.
Abstract
Finite-player nonzero-sum optimal stopping games typically lead to coupled equilibrium systems whose complexity grows rapidly with the number of players. We introduce an independently randomized formulation in which each stopping rule is represented by an adapted, nondecreasing cumulative stopping process. The canonical embedding preserves pure-profile payoffs, and a pure profile is a Nash equilibrium of the original game if and only if its embedding is a Nash equilibrium of the randomized game. We adopt the $\alpha$-potential approach to construct an $\alpha_N$-potential function, with the error $\alpha_N=O(N^{-1})$ under weak-interaction. We also identify an exact-potential subclass with a closed-form threshold equilibrium. For local stopped-status interactions, randomized payoffs admit a local stopped-mass representation, and potential maximization can be formulated as a multidimensional singular-control problem with local gradient constraints and a nonlocal condition for finite jumps. Under suitable regularity assumptions, we study the associated Hamilton-Jacobi-Bellman quasi-variational inequality and its regularity properties. For unknown model coefficients, we propose a bounded-intensity Potential-CT-DDPG learning algorithm. Numerical experiments closely match the analytical benchmark and yield estimated best-response improvements consistent with $N^{-1}$ scaling.