罗宾汉博弈的带记忆随机策略
Random strategies with memory for the Robin Hood game
摘要：
罗宾汉游戏的玩法如下：在第i天，警长把s（i）袋黄金放在洞穴里。在第i天晚上，罗宾把r（i）个袋子从洞里拿出来。游戏是为每个自然nymber i玩。罗宾赢，如果每个袋子，这是放在洞穴最终从它删除;否则警长赢。Gasarch，Golub和Srinivasan研究了罗宾汉游戏中的随机策略，其中罗宾没有历史记忆。我们将他们的主要结果推广到有界历史记忆的情形，得到了一个可证相异博弈的层次结构。
英文摘要：
The_Robin_Hood_ game is played as follows: On day i, the Sheriff puts s(i) bags of gold in the cave. On night i, Robin removes r(i) bags from the cave. The game is played for each natural nymber i. Robin wins if each bag which was put in the cave is eventually removed from it; otherwise the Sheriff wins. Gasarch, Golub, and Srinivasan studied the Robin Hood game in the case of random strategies where Robin has no historical memory. We extend their main result to the case of bounded historical memory, and obtain a hierarchy of provably distinct games.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
