The Library
Rendezvous search on the line with more than two players
Tools
Lim, Wei Shi, Alpern, Steve and Beck, Anatole (1997) Rendezvous search on the line with more than two players. Operations Research, 45 (3). pp. 357-364. ISSN 0030-364X.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://www.jstor.org/stable/172014
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 for 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 Rn,ms; otherwise the asymmetric value Rn,ma. We show that R3,2a=47/48, and that Rn,ns is asymptotic to n/2. These results respectively extend those for two players given by Alpern and Gal (1995) and Anderson and Essegaier (1995).
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Alternative Title: | |||||
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||
Library of Congress Subject Headings (LCSH): | Searching behavior -- Mathematical models | ||||
Journal or Publication Title: | Operations Research | ||||
Publisher: | Institute for Operations Research and the Management Sciences (I N F O R M S) | ||||
ISSN: | 0030-364X | ||||
Official Date: | May 1997 | ||||
Dates: |
|
||||
Volume: | 45 | ||||
Number: | 3 | ||||
Page Range: | pp. 357-364 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |