Infinite sums of combinatorial games (Dadaist games)
Paolo Lipparini
TL;DR
This paper introduces a new interpretation of infinite sums of combinatorial games, focusing on infinite plays without loops and exploring different notions of alternating runs.
Contribution
It provides a novel conceptual framework for understanding infinite sums in combinatorial game theory, particularly regarding infinite, loop-free plays.
Findings
Defines a natural notion of a run in infinite combinatorial games
Explores various concepts of alternating runs in infinite plays
Offers insights into the structure of infinite sums in game theory
Abstract
We propose an interpretation of the infinite sum of combinatorial games. In such an interpretation, plays involve infinite runs, but without loops. The notion of a run is quite natural, but different possibilities arises for the notion of an alternating run.
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.