It is known that in any tournament with $n$ vertices, there is a dominating set of size no more than $\lceil \log_2 n\rceil$. (See Fact 2.5 here.)

What about when the tournament is chosen probabilistically? What are some known results about the size of the minimum dominating set?