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.

Examples of this class of problem 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.

## See also

- probabilistic algorithm
- spontaneous symmetry breaking
- dining philosophers problem.