arXiv Analytics

Sign in

arXiv:1508.06032 [math.OC]AbstractReferencesReviewsResources

Non-zero-sum stopping games in discrete time

Zhou Zhou

Published 2015-08-25Version 1

We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to the other player's action. In the first part of the paper, we consider the game where players act simultaneously at each stage. We show that there exists a Nash equilibrium in mixed stopping strategies. In the second part, we assume that one player has to act first at each stage. In this case, we show the existence of a Nash equilibrium in pure stopping strategies.

Related articles: Most relevant | Search more
arXiv:2312.07703 [math.OC] (Published 2023-12-12)
Nash equilibria for dividend distribution with competition
arXiv:1505.01328 [math.OC] (Published 2015-05-06)
An $ε$-Nash equilibrium with high probability for strategic customers in heavy traffic
arXiv:2408.14433 [math.OC] (Published 2024-08-26)
Nash Equilibrium and Minimax Theorems via Variational Tools of Convex Analysis