Strategies in deterministic totally-ordered-time games
Tomohiko Kawamori
TL;DR
This paper introduces axioms for strategies in deterministic totally-ordered-time games and proves the existence and uniqueness of a consistent complete history for strategy tuples satisfying these axioms.
Contribution
It provides a formal axiomatic framework for strategies and establishes a unique correspondence with complete histories in such games.
Findings
Existence of a complete history consistent with strategy tuples.
Uniqueness of the complete history for strategy tuples satisfying the axioms.
Formal axiomatic characterization of 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Game Theory and Applications · Economic theories and models