Mikalački, Mirjana and Stojaković, Miloš - Fast strategies in biased Maker--Breaker games

dmtcs:4033 - Discrete Mathematics & Theoretical Computer Science, October 8, 2018, vol. 20 no. 2
Fast strategies in biased Maker--Breaker games

Authors: Mikalački, Mirjana and Stojaković, Miloš

We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on $b$, in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game.


Source : oai:arXiv.org:1602.04985
Volume: vol. 20 no. 2
Section: Graph Theory
Published on: October 8, 2018
Submitted on: October 31, 2017
Keywords: Mathematics - Combinatorics,91A24 Positional games, 91A43 Games involving graphs, 91A46 Combinatorial games


Share

Consultation statistics

This page has been seen 38 times.
This article's PDF has been downloaded 14 times.