The threshold bias of the clique-factor game

Let $r\ge 4$ be an integer and consider the following game on the complete graph $K_n$ for $n\in r\mathbb{Z}$: Two players, Maker and Breaker, alternately claim previously unclaimed edges of $K_n$ such that in each turn Maker claims one and Breaker claims $b\in \mathbb{N}$ edges. Maker wins if her graph contains a $K_r$-factor, that is a collection of $n\mathrm{/}r$ vertex-disjoint copies of $K_r$, and Breaker wins otherwise. In other words, we consider a $b$-biased $K_r$-factor Maker-Breaker game. We show that the threshold bias for this game is of order $n^{2\mathrm{/}(r+2)}$. This makes a step towards determining the threshold bias for making bounded-degree spanning graphs and extends a result of Allen et al.\ who resolved the case $r\in \{3,4\}$ up to a logarithmic factor.