For each $K \in \mathbb{N}$, assume that $X_1,X_2,\dots$ is an i.i.d. sequence of (discrete) uniform random variables on the set $\{1,\dots,K\}$ and, for each $T \in \mathbb{N}$, define the quantity $$ f(K,T):=\mathbb{E} \bigg[\max_{k \in \{1,\dots,K\}}\sum_{t=1}^T \mathbb{I}\{X_t=k\}\bigg] - \frac{T}{K} $$
I'm looking for a function $K^*:\mathbb{N} \to \mathbb{N}$ such that $$f\big(K^*(T),T\big) = \Omega(T^\alpha)\;,$$ for $\alpha>0$ as big as possible.
So far, what it seems clear to me is that for $K=2$ this is basically equivalent to computing the expected deviation of a symmetric random walk in dimension one from the origin, so $f(2,T)=\Omega\big(\sqrt{T}\big)$. On the other hand, if $K^*(T) \gg T$, the intuition suggests that $f\big(K^*(T),T\big)=O(1)$ (with high-probability, each $k \in \{1,\dots,K\}$ occurred just once). So, if we pick $K^*(T) = 2$ we get $\alpha = 1/2$, and if we get $K^*(T)$ too big, then $\alpha = 0$. However, what happens in between? What's a sensible way to select $K^*$ to get $\alpha$ as big as possible?
Any suggestions, pointers, or references?
The limit behavior is described in Kolchin, Sevast'yanov, Chistyakov Random allocations:
$^*$ This is quite cumbersome, so I won't write it.