Study on the three players' linear rendezvous search problem

Mohamed Abd Allah El-Hadidy

International Journal of Operational Research, 2018, vol. 33, issue 3, 297-314

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.

Keywords: rendezvous search problem; mixed strategy; Bayesian updates. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=95623 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:33:y:2018:i:3:p:297-314

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().