Study on the three players' linear rendezvous search problem
by Mohamed Abd Allah El-Hadidy
International Journal of Operational Research (IJOR), Vol. 33, No. 3, 2018

Abstract: 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.

Online publication date: Tue, 16-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com