ProV Logo
0

Fast strategies in biased Maker--Breaker...
Mikalački, Mirjana...
Fast strategies in biased Maker--Breaker games by Mikalački, Mirjana ( Author )
N.A
16-02-2016
We study the biased (1:b) Maker--Breaker positional games, played on the edge set of the complete graph on n vertices, Kn. 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.
-
Article
pdf
36.88 KB
English
-
MYR 0.01
-
https://arxiv.org/abs/1602.04985
Share this eBook