102,800
edits
Changes
From Nordan Symposia
Jump to navigationJump to searchCreated page with 'File:lighterstill.jpgright|frame ==Etymology== Middle French, from rendez vous - present yourselves *Date: [http://www.wikipedia.org/wiki/16th_Century...'
[[File:lighterstill.jpg]][[File:Barasoupe.png|right|frame]]
==Etymology==
Middle French, from rendez vous - present yourselves
*Date: [http://www.wikipedia.org/wiki/16th_Century 1582]
==Definitions==
*1 a : a place appointed for assembling or meeting
:b : a place of popular resort : haunt
*2 : a meeting at an appointed place and [[time]]
*3 : the [[process]] of bringing two spacecraft together
==Description==
:Rendezvous Problem
The '''rendezvous''' dilemma is related to the [http://en.wikipedia.org/wiki/Prisoner%27s_dilemma prisoner's dilemma] and can be formulated in this way:
<blockquote>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.</blockquote>
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.
[[Category: Sociology]]
==Etymology==
Middle French, from rendez vous - present yourselves
*Date: [http://www.wikipedia.org/wiki/16th_Century 1582]
==Definitions==
*1 a : a place appointed for assembling or meeting
:b : a place of popular resort : haunt
*2 : a meeting at an appointed place and [[time]]
*3 : the [[process]] of bringing two spacecraft together
==Description==
:Rendezvous Problem
The '''rendezvous''' dilemma is related to the [http://en.wikipedia.org/wiki/Prisoner%27s_dilemma prisoner's dilemma] and can be formulated in this way:
<blockquote>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.</blockquote>
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.
[[Category: Sociology]]
