对于K4上的对称交会搜索，Anderson-Weber策略不是最优的
The Anderson-Weber strategy is not optimal for symmetric rendezvous search on K4
摘要：
我们考虑n个位置的完全图上的对称会合搜索对策。1990年，安德森和韦伯提出了一个策略，在连续的n-1步的块中，参与者独立地选择留在他们的初始位置或游览其他n-1个位置，概率分别为p和1-p。他们的策略已被证明是最佳的n=2与p=1/2，和n=3与p=1/3。对于n=3的证明是非常复杂的，并且很难猜测对于n>3什么可能是真的。安德森和韦伯怀疑他们的策略在n>3时可能不是最优的，但他们没有特别的理由相信这一点，也没有人能找到更好的策略。本文介绍了一种策略，是优于安德森-韦伯n=4。然而，它只是好了百分之一的一小部分。
英文摘要：
We consider the symmetric rendezvous search game on a complete graph of n locations. In 1990, Anderson and Weber proposed a strategy in which, over successive blocks of n-1 steps, the players independently choose either to stay at their initial location or to tour the other n-1 locations, with probabilities p and 1-p, respectively. Their strategy has been proved optimal for n=2 with p=1/2, and for n=3 with p=1/3. The proof for n=3 is very complicated and it has been difficult to guess what might be true for n>3. 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. This paper describes a strategy that is better than Anderson--Weber for n=4. However, it is better by only a tiny fraction of a percent.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
