OpenAlex ·

Multiplayer Stopping Games with a Conditionally Atomless Filtration

Robert Samuel Simon, Eilon Solan and Grzegorz Tomkowicz

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2611.07184
Original
Read it at the publisher
Topics
Optimization & ControlProbabilityStatistics TheoryGeneral Finance

Abstract

Stopping games are the multiplayer generalization of optimal stopping problems, in which each player independently chooses when to stop, and the payoff depends on who stops first and when. While the existence of $\varepsilon$-equilibria in two-player stopping games with integrable payoffs is known, the multiplayer case has remained open. We prove that every multiplayer stopping game in discrete time with integrable payoff process admits an $\varepsilon$-equilibrium for every $\varepsilon > 0$, provided the filtration is conditionally atomless. This condition is satisfied, in particular, when the underlying probability space is $\{0,1\}^{\dN}$ endowed with the uniform measure and its natural filtration. Our method also shows that every three-player stopping game, without the restriction to conditionally atomless filtration, admits an $\varepsilon$-equilibrium, for every $\varepsilon > 0$. The proof combines techniques developed for two-player stopping games and for multiplayer quitting games, with a key new insight: the richness encoded in a conditionally atomless filtration can substitute for an external public randomization device, allowing players to coordinate without an explicit coordination signal.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Optimization & Control

Get the few papers worth your time in Optimization & Control every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics