Multistage Positional Games
Juri Barkey, Dennis Clemens, Fabian Hamann, Mirjana Mikala\v{c}ki,, Amedeo Sgueglia

TL;DR
This paper introduces and analyzes a new multistage variant of Maker-Breaker positional games, estimating the maximum game duration for various graph properties on complete graphs, revealing different behaviors in probabilistic and non-probabilistic cases.
Contribution
The paper defines the multistage Maker-Breaker game, provides bounds on its duration for key graph properties, and distinguishes between probabilistic and non-probabilistic behaviors in these games.
Findings
Maximum game duration estimates for several graph properties.
Probabilistic intuition applies to some games but not others.
Different behaviors observed in probabilistic versus non-probabilistic games.
Abstract
We initiate the study of a new variant of the Maker-Breaker positional game, which we call multistage game. Given a hypergraph and a bias , the multistage Maker-Breaker game on is played in several stages as follows. Each stage is played as a usual Maker-Breaker game, until all the elements of the board get claimed by one of the players, with the first stage being played on . In every subsequent stage, the game is played on the board reduced to the elements that Maker claimed in the previous stage, and with the winning sets reduced to those fully contained in the new board. The game proceeds until no winning sets remain, and the goal of Maker is to prolong the duration of the game for as many stages as possible. In this paper we estimate the maximum duration of the multistage…
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
TopicsGame Theory and Applications · Advanced Graph Theory Research · Limits and Structures in Graph Theory
