OPTIMAL STRATEGIES FOR RANDOM TOURNAMENT GAMES
OPTIMAL STRATEGIES FOR RANDOM TOURNAMENT GAMES
复制标题
DOI：
10.1016/0024-3795(94)00212-v
复制
发表时间：
1995-03-01
影响因子：
1.1
通讯作者：
REEVES, RB
中科院分区：
文献类型：
--
作者：
FISHER, DC;REEVES, RB
给定一个竞赛T，竞赛博弈是：两个玩家独立地选择T的一个节点。如果双方都选择相同的节点，则比赛是平局。否则，连接这两个节点的节点位于Are尾部的玩家获胜。费舍尔和瑞安证明了这场比赛有一个独特的最优策略。对于随机n节点竞赛上的竞赛对策，我们得到了最优策略使用k个节点的概率。
Given a tournament T, the tournament game is: Two players independently pick a node of T. If both pick the same node, the game is tied. Otherwise, the player whose node is at the tail of the are connecting the two nodes wins. Fisher and Ryan showed that this game has a unique optimal strategy. For a tournament game on a random n node tournament, we find the probability that the optimal strategy uses k nodes with nonzero probability.