Fast Rendezvous with Advice
Avery Miller, Andrzej Pelc

TL;DR
This paper determines the minimal amount of initial information (advice) needed for two mobile agents to rendezvous in optimal time proportional to their initial distance in a network.
Contribution
It establishes the exact asymptotic size of advice necessary and sufficient for rendezvous in optimal time, matching upper and lower bounds.
Findings
Advice size is (Dlog(n/D)+loglog L) for optimal rendezvous.
Constructed an advice string and algorithm achieving this advice size in (D) time.
Proved lower bounds showing smaller advice cannot guarantee optimal rendezvous time.
Abstract
Two mobile agents, starting from different nodes of an -node network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds using a deterministic algorithm. In each round, an agent decides to either remain idle or to move to one of the adjacent nodes. Each agent has a distinct integer label from the set , which it can use in the execution of the algorithm, but it does not know the label of the other agent. If is the distance between the initial positions of the agents, then is an obvious lower bound on the time of rendezvous. However, if each agent has no initial knowledge other than its label, time is usually impossible to achieve. We study the minimum amount of information that has to be available a priori to the agents to achieve rendezvous in optimal time .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Mobile Crowdsensing and Crowdsourcing · Advanced Bandit Algorithms Research
