Rendezvous search on the line

Shmuel Gal

doi:10.1287/opre.47.6.974

Rendezvous search on the line

Shmuel Gal

Department of Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

Two new results for the asymmetric rendezvous problem on the line are presented. It is shown that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. The meeting time of n-players in the worst case is considered which shows that its has an asymptotic behavior of n/2+O(log n).

Original language	English
Pages (from-to)	974-976
Number of pages	3
Journal	Operations Research
Volume	47
Issue number	6
DOIs	https://doi.org/10.1287/opre.47.6.974
State	Published - 1999

ASJC Scopus subject areas

Computer Science Applications
Management Science and Operations Research

Access to Document

10.1287/opre.47.6.974

Cite this

@article{2d8b8dc39d884e9db9267d4ac2ae1e10,

title = "Rendezvous search on the line",

abstract = "Two new results for the asymmetric rendezvous problem on the line are presented. It is shown that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. The meeting time of n-players in the worst case is considered which shows that its has an asymptotic behavior of n/2+O(log n).",

author = "Shmuel Gal",

year = "1999",

doi = "10.1287/opre.47.6.974",

language = "English",

volume = "47",

pages = "974--976",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "6",

}

TY - JOUR

T1 - Rendezvous search on the line

AU - Gal, Shmuel

PY - 1999

Y1 - 1999

N2 - Two new results for the asymmetric rendezvous problem on the line are presented. It is shown that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. The meeting time of n-players in the worst case is considered which shows that its has an asymptotic behavior of n/2+O(log n).

AB - Two new results for the asymmetric rendezvous problem on the line are presented. It is shown that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. The meeting time of n-players in the worst case is considered which shows that its has an asymptotic behavior of n/2+O(log n).

UR - http://www.scopus.com/inward/record.url?scp=0033345946&partnerID=8YFLogxK

U2 - 10.1287/opre.47.6.974

DO - 10.1287/opre.47.6.974

M3 - Article

AN - SCOPUS:0033345946

SN - 0030-364X

VL - 47

SP - 974

EP - 976

JO - Operations Research

JF - Operations Research

IS - 6

ER -

Rendezvous search on the line

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this