Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
ABSTRACT In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well‐known that if the parties have predetermined roles, then the strategy where one of them waits at one vertex, while …