$$\varepsilon $$-Nash Equilibria of a Multi-player Nonzero-Sum Dynkin Game in Discrete Time

Abstract

We study the infinite horizon discrete time N-player nonzero-sum Dynkin game ( $$N\ge 2$$ ) with stopping times as strategies (or pure strategies). We prove existence of an $$\varepsilon $$ -Nash equilibrium point for the game by presenting a constructive algorithm. One of the main features is that the payoffs of the players depend on the set of players that stop at the termination stage which is the minimal stage in which at least one player stops. The existence result is extended to the case of a nonzero-sum game with finite horizon. Finally, the algorithm is illustrated by two explicit examples in the specific case of finite horizon.