Improved bounds for the symmetric rendezvous value on the line
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
Two players are placed on a line at a distance d which is drawn from a known distribution F. The players have no common notion of direction on the line, and each has a resources bound on the total distance he can travel. If F is bounded and the resources are sufficiently large, then the players can ensure a meeting. The expected time minimization problem in that case has been studied by the authors in a previous paper. Aside from that case the most the players can do is maximize the probability that they meet. This is the problem studied here, for general and speci*cdistributions. This problem generalizes that of Foley et al. (1991), where one of the players is stationary (zero resources).