Rendezvous search on the line with bounded resources: Expected time minimization

Two players are placed on the line and want to meet. Neither knows the direction of the other, but they know the distance between them or perhaps the distribution of this distance. They can move with speed at most one, and each has a ‘resource constraint’ on the total distance he can travel. We first consider the question of whether the two players can ensure that they meet. When they can, then we seek the least expected meeting time. Otherwise, we maximize the probability of a meeting. This generalizes the similar problem studied by the first author and S. Gal without any resource constraint, and indeed for sufficiently large resources gives the same rendezvous time, i.e. least expected time to meet. The paper may also be considered a generalization of the Linear Search Problem, studied by the second author and others, which corresponds to the case when one of the resource constraints is zero, so that player cannot move. More specifically, it generalizes the bounded resource version of the Linear Search Problem presented by Foley et al.