Abstract:We extend graph theoretic characterizations of time structurable extensive games from finite informational digraphs to countable and continuum digraphs built on continuum rooted real trees. Introducing the symmetric class quotient poset of information sets as the canonical object an external clock must order, we develop a theory of transitive reduction for these quotients and prove existence and uniqueness under an interval finiteness condition. Under natural topological regularity assumptions like closed reachability classes, order density, and sigma compactness, we give necessary and sufficient conditions for real valued time labelings and construct measurable selection procedures in Polish spaces. We also provide constructive algorithms and a differential game example illustrating applications and computational implications.
From: Shravan Luckraz [view email]
[v1]
Thu, 25 Jun 2026 04:10:07 UTC (21 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。