The rendezvous dilemma is a logical dilemma, typically formulated in this way:
Two people have a date in a park they have never been to before. Arriving separately in the park, they are both surprised to discover that it is a huge area and consequently they cannot find one another. In this situation each person has to choose between waiting in a fixed place in the hope that the other will find them, or else starting to look for the other in the hope that they have chosen to wait somewhere.
If they both choose to wait, they will never meet. If they both choose to walk there are chances that they meet and chances that they do not. If one chooses to wait and the other chooses to walk, then there is a theoretical certainty that they will meet eventually; in practice, though, it may take too long for it to be guaranteed. The question posed, then, is: what strategies should they choose to maximize their probability of meeting?
Examples of this class of problems are known as rendezvous problems. These problems were first introduced informally by Steve Alpern in 1976,[1] and he formalised the continuous version of the problem in 1995.[2] This has led to much recent research in rendezvous search.[3] Even the symmetric rendezvous problem played in n discrete locations (sometimes called the Mozart Cafe Rendezvous Problem)[4] has turned out to be very difficult to solve, and in 1990 Richard Weber and Eddie Anderson conjectured the optimal strategy.[5] In 2012 the conjecture was proved for n = 3 by Richard Weber.[6] This was the first non-trivial symmetric rendezvous search problem to be fully solved. The corresponding asymmetric rendezvous problem has a simple optimal solution: one player stays put and the other player visits a random permutation of the locations.
As well as being problems of theoretical interest, rendezvous problems include real-world problems with applications in the fields of synchronization, operating system design, operations research, and even search and rescue operations planning.
^Alpern, Steve (1976), Hide and Seek Games, Seminar, Institut fur Hohere Studien, Wien, 26 July.
^Alpern, Steve (1995), "The rendezvous search problem", SIAM Journal on Control and Optimization, 33 (3): 673–683, doi:10.1137/S0363012993249195, MR 1327232
^Alpern, Steve; Gal, Shmuel (2003), The Theory of Search Games and Rendezvous, International Series in Operations Research & Management Science, vol. 55, Boston, MA: Kluwer Academic Publishers, ISBN 0-7923-7468-1, MR 2005053.
^Alpern, Steve (2011), "Rendezvous search games", in Cochran, James J. (ed.), Wiley Encyclopedia of Operations Research and Management Science, Wiley, doi:10.1002/9780470400531.eorms0720.
^Anderson, E. J.; Weber, R. R. (1990), "The rendezvous problem on discrete locations", Journal of Applied Probability, 27 (4): 839–851, doi:10.2307/3214827, JSTOR 3214827, MR 1077533, S2CID 122587972.
^Weber, Richard (2012), "Optimal symmetric Rendezvous search on three locations" (PDF), Mathematics of Operations Research, 37 (1): 111–122, doi:10.1287/moor.1110.0528, MR 2891149.
and 18 Related for: Rendezvous problem information
probability of meeting? Examples of this class of problems are known as rendezvousproblems. These problems were first introduced informally by Steve Alpern...
Look up Rendezvous or rendezvous in Wiktionary, the free dictionary. Rendezvous or rendez-vous may refer to: The Rendezvous (1923 film), a silent film...
The deterministic rendezvousproblem is a variant of the rendezvousproblem where the players, or robots, must find each other by following a deterministic...
The Monty Hall problem is a brain teaser, in the form of a probability puzzle, based nominally on the American television game show Let's Make a Deal...
periodic? Is the nim-sequence of Grundy's game eventually periodic? Rendezvousproblem Abundance conjecture: if the canonical bundle of a projective variety...
concentrated in the fields of search games and rendezvous. He informally introduced the rendezvousproblem as early as 1976. His collaborators include Shmuel...
A space rendezvous (/ˈrɒndeɪvuː/) is a set of orbital maneuvers during which two spacecraft, one of which is often a space station, arrive at the same...
protocols use rendezvous hashing to pick a rendezvous point. Rendezvous hashing solves a general version of the distributed hash table problem: We are given...
synchronization and related topics Concurrency control Interlocking Rendezvousproblem Room synchronization Synchronization gear Video and audio engineering...
reluctant to categorically state that solving chess is an intractable problem. In 1950, Shannon calculated, based on a game tree complexity of 10120...
Rendezvous with Rama is a 1973 science fiction novel by British writer Arthur C. Clarke. Set in the 2130s, the story involves a 50-by-20-kilometre (31...
topology and the initial condition for each agent. Other problems are the rendezvousproblem, synchronization, flocking, formation control. One solution...
bargaining game Induction puzzles Trust game Princess and monster game Rendezvousproblem Theorems Arrow's impossibility theorem Aumann's agreement theorem...
number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which...
Heechee Rendezvous is a science fiction novel by the American writer Frederik Pohl, published in 1984 by the Del Rey imprint of Ballantine Books. It is...
10 November 2023. "Rendezvous with the Future". Bilibili. 2022. "刘慈欣：《三体》的成功只是特例" [Liu Cixin: The Success of 'The Three Body Problem' Is Just a Special...
Rendezvous with the Future is a documentary series commissioned by Bilibili and produced by BBC Studios which explores the science behind the science fiction...
Global Information