Strategies in deterministic totally-ordered-time games
Abstract
We consider deterministic totally-ordered-time games. We present three axioms for strategies. We show that for any tuple of strategies that satisfy the axioms, there exists a unique complete history that is consistent with the strategy tuple.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.