Under the auspices of the Computational Complexity Foundation (CCF)
Three-player number-on-forehead pointer chasing has communication complexity $\le n^{1-c}$. A bound $n/\log^{c}n$ was known since the 90's.