Rendezvous problem

Rendezvous problem

The rendezvous dilemma is related to the prisoner's dilemma and can be formulated in this way:

:Two young 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, of course, 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, they would need an infinite amount of time 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.

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.

ee also

* probabilistic algorithm
* spontaneous symmetry breaking
* dining philosophers problem
* sleeping barber problem
* superrationality

External links

* [http://www.statslab.cam.ac.uk/~rrw1/abstracts/a90a.html E.J. Anderson, R.R. Weber. "The rendezvous problem on discrete locations"]
* [http://atlas-conferences.com/c/a/h/p/49.htm Tracy Truong. "Exploration a two sided rendezvous search problem using genetic algorithms."]
* http://epubs.siam.org/sam-bin/dbq/article/24919


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Rendezvous — may refer to:Meetings and gatherings* A planned meeting between two or more parties * A meeting between mountain men and fur buyers * A meeting of buckskinners * An annual festival organized by the Indian Institute of Technology Delhi Computing*… …   Wikipedia

  • Sleeping barber problem — In computer science, the sleeping barber problem is a classic inter process communication and synchronization problem between multiple operating system processes. The problem is analogous to that of keeping a barber working when there are… …   Wikipedia

  • Space rendezvous — A space rendezvous is an orbital maneuver during which two spacecraft, one of which is often a space station, arrive at the same orbit and approach to a very close distance (e.g. within visual contact). Rendezvous requires a precise match of the… …   Wikipedia

  • n-body problem — This article is about the problem in classical mechanics. For the problem in quantum mechanics, see Many body problem. The n body problem is the problem of predicting the motion of a group of celestial objects that interact with each other… …   Wikipedia

  • Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

  • Near Earth Asteroid Rendezvous Shoemaker — ▪ spacecraft  first spacecraft to orbit and then land on an asteroid ( Eros, on Feb. 12, 2001).  The NEAR spacecraft was launched by the U.S. National Aeronautics and Space Administration on Feb. 17, 1996. Its destination, Eros, was the second… …   Universalium

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • Prisoner's dilemma — This article is about game theory. For the 1988 novel, see Prisoner s Dilemma (novel). For the Doctor Who audiobook, see The Prisoner s Dilemma. For the 2001 play, see The Prisoner s Dilemma (play). The prisoner’s dilemma is a canonical example… …   Wikipedia

  • List of mathematics articles (R) — NOTOC R R. A. Fisher Lectureship Rabdology Rabin automaton Rabin signature algorithm Rabinovich Fabrikant equations Rabinowitsch trick Racah polynomials Racah W coefficient Racetrack (game) Racks and quandles Radar chart Rademacher complexity… …   Wikipedia

  • Wait/walk dilemma — The Wait/walk dilemma occurs when waiting for a bus at a bus stop, when the duration of the wait may exceed the time needed to arrive at a destination by another means, especially walking. The dilemma has been studied in an unpublished report… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”