Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution

2002

Operations Research

Section: They Wish To Minimize the Time T When They First Pick Up Paimentioning

confidence: 98%

Section: They Wish To Minimize the Time T When They First Pick Up Paimentioning

confidence: 99%

Section: Symmetric Versionmentioning

confidence: 99%

“…By optimizing the probability of these four motions, and by making use of observations similar to those given above regarding their interaction, Baston (1999) …”

Section: Alpern / 779mentioning

confidence: 99%

Section: Minimax Multirendezvous On the Linementioning

confidence: 99%

See 3 more Smart Citations

Rendezvous Search: A Personal Perspective

2002

Operations Research

Rendezvous Search Games

Wiley Encyclopedia of Operations Research and Management Science

2011

Rendezvous search studies the problem faced by a number of people (or animals or robots) who are trying to find each other after becoming separated (perhaps by a storm) or on reaching a large meeting area independently. Formally, it is a common‐interest game where two (or more) unit speed players seek to minimize the time taken to meet. The game begins with a known (sometimes, an unknown) joint distribution of the players in a known search region Q , which is dark (so the players cannot see each other until they are sufficiently close). Although originally proposed by the author in 1976, these problems did not receive much attention until the 1990s. However, much progress has been made in the last 20 years. These games can be viewed as search game extensions of the spatial coordination problems posed by Schelling in 1960. But where Schelling was concerned with “focal points,” the rendezvous theory typically avoids these by assuming symmetrical search regions.

Rendezvous search on labeled networks

Naval Research Logistics

2002

Abstract:Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy.