论文标题
作弊机器人游戏：内幕信息的模型
Cheating Robot Games: A model for insider information
论文作者
论文摘要
组合游戏是纯策略的两人游戏，通常称为左右运动的玩家交替移动。在本文中，我们介绍了作弊机器人游戏。这些来自同时玩游戏的组合游戏，其中一个玩家拥有内部信息（“作弊”）。比赛发生。在回合开始时，两位球员都知道他们可用的动作。左选择一个动作。知道左行动，然后选择了一个动作。右的举动并不受左选择的限制。直到两个球员都做出选择之前，该回合才完成。仅当一个或两个球员在回合开始时没有动作时，游戏才能完成。正确选择一项动作，知道左派，使游戏确定性，将它们与同时的游戏区分开来。此外，结局条件将这类游戏与组合游戏区分开来，因为结果现在是左获胜，右获胜和绘制。 开发了基本理论和属性，包括表明游戏中存在等效关系和部分顺序。尽管所有游戏类别都没有逆，但我们表明有一个子类简单的热游戏，整数中都有倒置。在此子类中，最佳策略是通过对图上的最小重量匹配问题的解决方案获得的，该图的数量等于析取总和中的汇总数量。
Combinatorial games are two-player games of pure strategy where the players, usually called Left and Right, move alternately. In this paper, we introduce Cheating Robot games. These arise from simultaneous-play combinatorial games where one player has insider information ('cheats'). Play occurs in rounds. At the beginning of a round, both players know the moves that are available to them. Left chooses a move. Knowing Left's move, Right then chooses a move. Right's move is not constrained by Left's choice. The round is not completed until both players have made a choice. A game is finished only when one or both players do not have a move at the beginning of a round. Right choosing a move, knowing Left's, makes the games deterministic, distinguishing them from simultaneous games. Also, the ending condition distinguishes this class of games from combinatorial games, since the outcomes are now Left-win, Right-win and draw. The basic theory and properties are developed, including showing that there is an equivalence relation and partial order on the games. Whilst there are no inverses in the class of all games, we show that there is a sub-class, simple hot games, in which the integers have inverses. In this sub-class, the optimal strategies are obtained by the solutions to a minimum-weight matching problem on a graph whose number of vertices equals the number of summands in the disjunctive sum.
