Study on the three players' linear rendezvous search problem
Mohamed Abd Allah El‐Hadidy · International Journal of Operational Research · 2018
This paper considers the symmetric rendezvous problem of three players on the line. This problem asks how the players forced to use the same mixed strategy, can minimise their expected meeting time. This minimum is called the 'symmetric' rendezvous value of the line. In our problem we consider the effect on rendezvous time of giving the players some information about past actions and chance moves, enabling each of them to apply Bayesian updates to improve the knowledge of the other's whereabouts. This technique can be used to give lower bounds on rendezvous time of the original game (without any revealed information). Our approach is to concentrate on a general analysis of the effect of revelations, rather than compute the best bounds possible with our techniques.