Rendezvous Search with Revealed Information: Applications to the Line
نویسندگان
چکیده
منابع مشابه
Rendezvous Search with Revealed Information: Applications to the Line
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’ofQ. Traditionally, the players are assumed to receive no information while playing the game. We consider the effect on rendezv...
متن کاملRendezvous Search with Revealed Information: Applications to the Line
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 valueof Q: Traditionally, the players are assumed to receive no information during the play of the game. We consider the e¤ect on re...
متن کاملRendezvous-evasion search in two boxes with incomplete information
An agent (who may or may not want to be found) is located in one of two boxes. At time 0 suppose that he is in box B. With probability p he wishes to be found, in which case he has been asked to stay in box B. With probability 1−p he tries to evade the searcher, in which case he may move between boxes A and B. The searcher looks into one of the boxes at times 1, 2, 3, . . .. Between each search...
متن کاملDistributed Search with Rendezvous Search Systems
The ever-growing amount of data made available through the Internet requires powerful and highly scalable search systems. Not only the mostly unstructured data but also the increasing user expectations demand for sophisticated and flexible search primitives like keyword search or XPath. Academic research on peer-to-peer networks has been mostly focused on how to build such advanced primitives o...
متن کاملSymmetric Rendezvous Search on the Line using Move Patterns with Different Lengths
The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to define mixed (randomized) strategies, and formalize a general scheme to compute the expected rendezvous time of mixed strategies. We introduce a strategy that has the following properties: (1) move patterns have different lengths, and (2) the probability of choosing a move pattern in the current ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2007
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200002680