How fast can Maker win in fair biased games?

We study (a:a) Maker-Breaker games played on the edge set of the complete graph on n vertices. In the following four games - perfect matching game, Hamilton cycle game, star factor game and path factor game, our goal is to determine the least number of moves which Maker needs in order to win these games. Moreover, for all games except for the star factor game, we show how Red can win in the strong version of these games.

[1]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[2]  Dan Hefetz,et al.  Doubly Biased Maker-Breaker Connectivity Game , 2011, Electron. J. Comb..

[3]  J. Beck.  Combinatorial Games: Tic-Tac-Toe Theory , 2008 .

[4]  Michael Krivelevich,et al.  Fast Strategies In Maker–Breaker Games Played on Random Boards , 2012, Combinatorics, Probability and Computing.

[5]  Tibor Szabó,et al.  Asymptotic random graph intuition for the biased connectivity game , 2009, Random Struct. Algorithms.

[6]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[7]  Sebastian U. Stich,et al.  On Two Problems Regarding the Hamiltonian Cycle Game , 2009, Electron. J. Comb..

[8]  Asaf Ferber,et al.  Weak and strong kk-connectivity games , 2012, Eur. J. Comb..

[9]  Michael Krivelevich,et al.  Positional Games , 2014, 1404.2731.

[10]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[11]  József Balogh,et al.  The diameter game , 2009, Random Struct. Algorithms.

[12]  Asaf Ferber,et al.  Winning Strong Games through Fast Strategies for Weak Games , 2011, Electron. J. Comb..

[13]  Michael Krivelevich,et al.  Fast winning strategies in Maker-Breaker games , 2009, J. Comb. Theory, Ser. B.