2000 character limit reached
Playing with ghosts in a Dynkin game (1905.06564v1)
Published 16 May 2019 in math.PR, econ.GN, math.OC, and q-fin.EC
Abstract: We study a class of optimal stopping games (Dynkin games) of preemption type, with uncertainty about the existence of competitors. The set-up is well-suited to model, for example, real options in the context of investors who do not want to publicly reveal their interest in a certain business opportunity. We show that there exists a Nash equilibrium in randomized stopping times which is described explicitly in terms of the corresponding one-player game.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.