Summary: We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree $\varDelta=3$ is at most $\varDelta+1$. We show that the same holds true in case $\varDelta\geqslant6$, which would leave only the cases $\varDelta=4$ and 5 open.