3 problems

Let $X^1,X^2,Y^1,Y^2,Z^1,Z^2$ be the payoff processes of a non-zero-sum Dynkin game, with payoff functions … … Define the regions…

Consider a filtered probability space with horizon $T$, adapted right-continuous payoff processes $X$, $Y$, and $Z$, and stopping times $\tau,\sigma$ in $\mathcal{T}_{[0,T]}$. Defi…

Upper-threshold conjecture. Following the heuristics above, Player 2 will construct $Gamma^{,1}$ in a way that reflects the process Phi^ at an upper threshold.