{"paper":{"title":"On Zero-sum Optimal Stopping Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","q-fin.MF"],"primary_cat":"math.PR","authors_text":"Erhan Bayraktar, Zhou Zhou","submitted_at":"2014-08-16T01:41:58Z","abstract_excerpt":"On a filtered probability space $(\\Omega,\\mathcal{F},P,\\mathbb{F}=(\\mathcal{F}_t)_{t=0,\\dotso,T})$, we consider stopper-stopper games $\\overline V:=\\inf_{\\Rho\\in\\bT^{ii}}\\sup_{\\tau\\in\\T}\\E[U(\\Rho(\\tau),\\tau)]$ and $\\underline V:=\\sup_{\\Tau\\in\\bT^i}\\inf_{\\rho\\in\\T}\\E[U(\\Rho(\\tau),\\tau)]$ in discrete time, where $U(s,t)$ is $\\mathcal{F}_{s\\vee t}$-measurable instead of $\\mathcal{F}_{s\\wedge t}$-measurable as is often assumed in the literature, $\\T$ is the set of stopping times, and $\\bT^i$ and $\\bT^{ii}$ are sets of mappings from $\\T$ to $\\T$ satisfying certain non-anticipativity conditions. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3692","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}