Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Luckraz, Shravan
Institution: University of Nottingham Ningbo China
Topic: Game Theory and Applications
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W7166139579
Cites:
Cited by:
Related to: