A tournament on $k2^k$ vertices always contains a dominating set of size $k$.

Question

This is a continuation of this question. Please see the definitions and proof attempt 2.

I discovered that a similar argument was used to prove the statement for the tournaments of size $2^k$ (as in, for example, this document, Fact 2.5.). I can’t seem to improve the bound further, and would need some help.