K3上对称交会搜索的最优策略
The optimal strategy for symmetric rendezvous search on K3
摘要：
在Kn（n个顶点上的完全连通图）上进行的对称会合搜索博弈中，两个参与者最初被放置在两个不同的顶点（称为位置）。游戏是在离散的步骤中进行的，在每一步中，每个玩家都可以留在原地或移动到不同的位置。玩家没有共同的位置标签。他们希望在第一次见面之前尽量减少预期的步骤数。这种类型的Renminbi搜索游戏最早由Steve Alpern在1976年提出。它们很容易描述，并且在大众媒体中受到了相当大的关注，因为它们模拟了现实生活中熟悉的问题。他们是出了名的难以分析。我们的解决方案的对称会合游戏在K3上，使这是第一个有趣的游戏，其类型被解决，并建立了一个20岁的猜想，安德森-韦伯战略是最佳的。
英文摘要：
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). The game is played in discrete steps and at each step each player can either stay where he is or move to a different location. The players share no common labelling of the locations. They wish to minimize the expected number of steps until they first meet. Rendezvous search games of this type were first proposed by Steve Alpern in 1976. They are simple to describe, and have received considerable attention in the popular press as they model problems that are familiar in real life. They are notoriously difficult to analyse. 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
