Hamadène, Said; Hassani, Mohammed - In: Mathematical Methods of Operations Research 79 (2014) 2, pp. 179-194
We study the infinite horizon discrete time N-player nonzero-sum Dynkin game (<InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$N \ge 2$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <mi>N</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math> </EquationSource> </InlineEquation>) with stopping times as strategies (or pure strategies). The payoff depends on the set of players that stop at the termination stage (where the termination stage is the minimal stage in...</equationsource></equationsource></inlineequation>