“…In this paper, we study tradeoffs between the amount of information available a priori to the agents and the cost of rendezvous and treasure hunt. Following the paradigm of algorithms with advice [1,14,16,21,26,28,29,30,31,32,33,34,36,37,38,44,49], this information is provided to the agents at the start of their navigation by an oracle that knows the network, the starting positions of the agents and, in the case of treasure hunt, the node where the treasure is hidden. The oracle assists the agents by providing them with a binary string called advice, which can be used by the agent during the algorithm execution.…”