Abstract In this paper we solve the rendezvous problem on line with markers that can be dropped at chosen times when initial distance D between players is known. case of one marker, $$M_1$$ M 1 game, marker held by player II start game and, once and found I, indicates i...

Suppose a target is hidden in one of the vertices an edge-weighted graph according to known probability distribution. Starting from fixed root node, expanding search visits sequentially until it finds target, where next vertex can be reached any previously visited vertices. That is, time reach equals shortest-path distance set all The problem then asks for sequence nodes, so as minimize expecte...