| 词条 | Rendezvous problem |
| 释义 |
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] Only recently has the conjecture been proved for n = 3 by Richard Weber.[6] This was the first non-trivial symmetric rendezvous search problem to be fully solved. Note that the corresponding asymmetric rendezvous problem has a simple optimal solution: one player waits at his original location and the other player looks for him using 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. Deterministic rendezvous problem{{main|Deterministic rendezvous problem}}The deterministic rendezvous problem is a variant of the rendezvous problem where the players, or robots, must find each other by following a deterministic sequence of instructions. Although each robot follows the same instruction sequence, a unique label assigned to each robot is used for symmetry breaking.[7] See also
References1. ^{{citation | last = Alpern | first = Steve | authorlink = Steve Alpern | year = 1976 | title = Hide and Seek Games | publisher = Seminar, Institut fur Hohere Studien, Wien, 26 July}}. {{game theory}}2. ^{{citation | last = Alpern | first = Steve | authorlink = Steve Alpern | doi = 10.1137/S0363012993249195 | issue = 3 | journal = SIAM Journal on Control and Optimization | mr = 1327232 | pages = 673–683 | title = The rendezvous search problem | volume = 33 | year = 1995}} 3. ^{{citation | last1 = Alpern | first1 = Steve | author1-link = Steve Alpern | last2 = Gal | first2 = Shmuel | author2-link = Shmuel Gal | isbn = 0-7923-7468-1 | location = Boston, MA | mr = 2005053 | publisher = Kluwer Academic Publishers | series = International Series in Operations Research & Management Science | title = The Theory of Search Games and Rendezvous | volume = 55 | year = 2003}}. 4. ^{{citation | last = Alpern | first = Steve | author-link = Steve Alpern | editor-last = Cochran | editor-first = James J. | contribution = Rendezvous search games | doi = 10.1002/9780470400531.eorms0720 | publisher = Wiley | title = Wiley Encyclopedia of Operations Research and Management Science | year = 2011}}. 5. ^{{citation | last1 = Anderson | first1 = E. J. | last2 = Weber | first2 = R. R. | author2-link = Richard Weber (mathematician) | issue = 4 | journal = Journal of Applied Probability | mr = 1077533 | pages = 839–851 | title = The rendezvous problem on discrete locations | url = http://www.statslab.cam.ac.uk/~rrw1/abstracts/a90a.html | volume = 27 | year = 1990 | doi=10.2307/3214827}}. 6. ^{{citation | last = Weber | first = Richard | authorlink = Richard Weber (mathematician) | doi = 10.1287/moor.1110.0528 | issue = 1 | journal = Mathematics of Operations Research | mr = 2891149 | pages = 111–122 | title = Optimal symmetric Rendezvous search on three locations | url = http://www.statslab.cam.ac.uk/~rrw1/research/K3%20revised.pdf | volume = 37 | year = 2012}}. 7. ^{{cite journal|last1=Ta-Shma|first1=Amnon|last2=Zwick|first2=Uri|author2-link=Uri Zwick|title=Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences|journal=ACM Transactions on Algorithms|date=April 2014|volume=10|issue=3|at=12}} 1 : Cooperative games |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。