The Rendezvous search problem asks how two noncomunnicating players, who move at unit-speed after a random placement in the search region (in this paper, the line), can minimize their expected meeting time. Baston and Gal cite{bastongal2001} solved a version where each player leaves a marker at his starting point, for example parachutes left after jumping into the search region. Here we consider that one or both players have markers which they can drop at chosen times. When the players are placed facing random directions at a distance $D$ on the line the optimal expected meeting times $R$ are known to be as follows: With no markers, $R=13D/8$; with one each dropped at the start, $R=3D/2$. Here we show that when only one player has a marker,...
We apply a new method of analysis to the asymmetric rendezvous search problem on the line (ARSPL). T...
In the symmetric rendezvous search game played on n locations two players are initially placed at tw...
We have found a formulation that improves upon the best values for rendezvous search on the complete...
The Rendezvous search problem asks how two noncomunnicating players, who move at unit‐speed after a ...
Rendezvous search finds the strategies that players should use in order to find one another when the...
We consider a new type of asymmetric rendezvous search problem in which player II needs to give play...
The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to ...
Two people are placed randomly and independently on a street of unit length. They attempt to find ea...
In a rendezvous search problem, two players are placed in a network and must try to meet each other ...
The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to...
Rendezvous problems and search games (with two players) are related problems. In a rendezvous proble...
The classical asymmetric rendezvous search problem on the line is faced by two people who, facing in...
In this paper we solve the rendezvous problem on the line with markers that can be dropped at chosen...
Two friends have become separated in a building or shopping mall and and wish to meet as quickly as ...
Suppose n blind, speed one, players are placed by a random permutation onto the integers 1 to n, and...
We apply a new method of analysis to the asymmetric rendezvous search problem on the line (ARSPL). T...
In the symmetric rendezvous search game played on n locations two players are initially placed at tw...
We have found a formulation that improves upon the best values for rendezvous search on the complete...
The Rendezvous search problem asks how two noncomunnicating players, who move at unit‐speed after a ...
Rendezvous search finds the strategies that players should use in order to find one another when the...
We consider a new type of asymmetric rendezvous search problem in which player II needs to give play...
The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to ...
Two people are placed randomly and independently on a street of unit length. They attempt to find ea...
In a rendezvous search problem, two players are placed in a network and must try to meet each other ...
The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to...
Rendezvous problems and search games (with two players) are related problems. In a rendezvous proble...
The classical asymmetric rendezvous search problem on the line is faced by two people who, facing in...
In this paper we solve the rendezvous problem on the line with markers that can be dropped at chosen...
Two friends have become separated in a building or shopping mall and and wish to meet as quickly as ...
Suppose n blind, speed one, players are placed by a random permutation onto the integers 1 to n, and...
We apply a new method of analysis to the asymmetric rendezvous search problem on the line (ARSPL). T...
In the symmetric rendezvous search game played on n locations two players are initially placed at tw...
We have found a formulation that improves upon the best values for rendezvous search on the complete...