Doubly biased Maker-Breaker Connectivity game
Dan Hefetz, Mirjana Raki\'c, Milo\v{s} Stojakovi\'c
TL;DR
This paper analyzes the (a : b) Maker-Breaker Connectivity game on complete graphs, identifying the winning strategies for nearly all parameter values, thus advancing understanding of positional game outcomes.
Contribution
It provides a comprehensive determination of the winner for almost all (a, b) pairs in the Maker-Breaker Connectivity game on complete graphs.
Findings
Identifies winning strategies for most (a, b) configurations.
Completes the classification of game outcomes for the majority of parameter pairs.
Enhances understanding of positional game dynamics on complete graphs.
Abstract
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge-set of the complete graph on n vertices. We determine the winner for almost all values of a and b.
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
TopicsOptimization and Search Problems · Game Theory and Applications · Advanced Graph Theory Research