The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
The Anderson-Weber strategy is not optimal for symmetric rendezvous search on K4
[article]
2009
arXiv
pre-print
Preserved Fulltext
We consider the symmetric rendezvous search game on a complete graph of n locations. ...
Anderson and Weber suspected that their strategy might not be optimal for n>3, but they had no particular reason to believe this and no one has been able to find anything better. ...
The Anderson-Weber strategy In the symmetric rendezvous search game on K n (the completely connected graph on n vertices) two players are initially placed at two distinct vertices (called locations). ...
arXiv:0912.0670v1
fatcat:hc6st3kwabeghpgw6dkge4att4
The optimal strategy for symmetric rendezvous search on K3
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Our solution of the symmetric rendezvous game on K3 makes this the first interesting game of its type to be solved, and establishes a 20 year old conjecture that the Anderson-Weber strategy is optimal. ...
In the symmetric rendezvous search game played on Kn (the completely connected graph on n vertices) two players are initially placed at two distinct vertices (called locations). ...
Theorem 1 The Anderson-Weber strategy is optimal for the symmetric rendezvous search game on K 3 , minimizing E[min{T, k + 1}] to w k for all k = 1, 2, . . . , where w k = 5 2 − 5 2 3 − k+1 2 , when ...
arXiv:0906.5447v1
fatcat:zskeewnlenen3e2p3dlcmclx7m
Optimal Symmetric Rendezvous Search on Three Locations
2012
Mathematics of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this paper we prove a 20 year old conjecture that the following strategy is optimal for the game on three locations: in each block of two steps, stay where you, or search the other two locations in ...
This is now the first nontrivial symmetric rendezvous search game to be fully solved. ...
Without his enthusiasm for studing this problem I might not have had the courage to work on it once more. ...
doi:10.1287/moor.1110.0528
fatcat:uqkh42xhangy3lgxlqyi43btv4
Game-theoretic and other Algorithmic Aspects of Mobile Crowdsensing
2021
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Weber, Richard (2012). “Optimal Symmetric Rendezvous Search on Three Loca-
tions”. In: Mathematics of Operations Research 37.1, pp. 111–122. ...
The modified strategy (on the way to Modified Wait For Mommy, see
right of Figure 4.6) is not yet optimal, but it shows that the original WFM strategy
was not optimal. ...
doi:10.13097/archive-ouverte/unige:157618
fatcat:gk6msq7fhbd3tfn3xkvqmu74wq