Kamran Ayoubi

In the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, it is shown that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.