Abstract
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.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference14 articles.
1. [13] Uthaisombut P. (2006). Symmetric rendezvous search on the line using move patterns with different lengths. Submitted.
2. [14] Weber R. R. (2006). The optimal strategy for symmetric rendezvous search on K_{3}. Preprint, Statistical Laboratory, University of Cambridge. Available at http://www.statslab.cam.ac.uk/∼rrw1/research/weber-k3.pdf.
3. Rendezvous search on a graph
4. Learning How to Cooperate: Optimal Play in Repeated Coordination Games
5. The Rendezvous Search Problem
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献