Rendezvous Search on the Line with More Than Two Players

Wei Shi Lim, Steve Alpern and Anatole Beck
Additional contact information
Wei Shi Lim: National University of Singapore, Singapore and London School of Economics, London, England
Steve Alpern: London School of Economic, London, England
Anatole Beck: University of Wisconsin, Madison, Wisconsin and London School of Economics, London, England

Operations Research, 1997, vol. 45, issue 3, 357-364

Abstract: Suppose n blind, speed one, players are placed by a random permutation onto the integers 1 to n , and each is pointed randomly to the right or left. What is the least expected time required form m ≤ n of them to meet together at a single point? If they must all use the same strategy we call this time the symmetric rendezvous value R n , m s ; otherwise the asymmetric value R n , m a . We show that R 3,2 a = 47/48, and that R n , n s is asymptotic to n /2. These results respectively extend those for two players given by Alpern and Gal (Alpern, S., S. Gal. 1995. Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. 33 1270–1276.) and Anderson and Essegaier (Anderson, E. J., S. Essegaier. 1995. Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. 33 1637–1642.).

Keywords: search and surveillance; rendezvous search with many players (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.3.357 (application/pdf)

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:inm:oropre:v:45:y:1997:i:3:p:357-364

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().