Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-17T22:15:22.955Z Has data issue: false hasContentIssue false

Rendezvous Search with Revealed Information: Applications to the Line

Published online by Cambridge University Press:  14 July 2016

Steve Alpern*
Affiliation:
London School of Economics
*
∗ Postal address: Department of Mathematics, London School of Economics, London WC2A 2AE, UK. Email address: s.alpern@lse.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q. This minimum is called the (symmetric) ‘rendezvous value’ of Q. Traditionally, the players are assumed to receive no information while playing the game. We consider the effect on rendezvous times of giving the players some information about past actions and chance moves, enabling each of them to apply Bayesian updates to improve his knowledge of the other's whereabouts. This technique can be used to give lower bounds on the rendezvous times of the original game (without any revealed information). We consider the case in which they are placed a known distance apart on the line graph Q (known as ‘symmetric rendezvous on the line’). Our approach is to concentrate on a general analysis of the effect of revelations, rather than compute the best bounds possible with our technique.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2007