Faster Symmetric Rendezvous on Four or More Locations

Javier Cembrano, Felix Fischer, Max Klimm

In the symmetric rendezvous problem, two players follow the same (randomized) strategy to visit one of $n$ locations in each time step $t=0,1,2,\dots$. Their goal is to minimize th…