Oblivious Self-Distance Symmetric Rendezvous on the Integer Line

Konstantinos Georgiou, Claude Gravel, Lazar Mandic +1

Symmetric rendezvous on the line is a search problem in which two agents, initially placed at distance $2d$, must follow the same randomized strategy to meet as quickly as possible…