• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computational Intelligence and AI in Games, IEEE Transactions on >Elicitation of Strategies in Four Variants of a Round-Robin Tournament: The Case of Goofspiel
【24h】

Elicitation of Strategies in Four Variants of a Round-Robin Tournament: The Case of Goofspiel

机译：循环赛四个变体中策略的启发：Goofspiel的案例

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Goofspiel is a simple two-person zero-sum game for which there exist no known equilibrium strategies. To gain insight into what constitute winning strategies, we conducted a round-robin tournament in which participants were asked to provide computerized programs for playing the game with or without carryover. Each of these two variants was to be played under two quite different objective functions, namely, maximization of the cumulative number of points won across all opponents (as in Axelrod's tournament), and maximization of the probability of winning any given round. Our results show that there are, indeed, inherent differences in the results with respect to the complexity of the game and its objective function, and that winning strategies exhibit a level of sophistication, depth, and balance that are not captured by present models of adaptive learning.
机译：Goofspiel是一个简单的两人零和游戏，尚无已知的均衡策略。为了了解什么是获胜策略，我们进行了一次循环锦标赛，要求参与者提供计算机程序来玩游戏，无论是否携带遗留物。这两个变体中的每一个都将在两个完全不同的目标函数下进行比赛，即最大化所有对手赢得的累积积分数（如在Axelrod的锦标赛中），以及最大化赢得任何给定回合的概率。我们的结果表明，关于游戏的复杂性及其目标功能，结果的确存在内在差异，而获胜策略表现出了复杂程度，深度和平衡水平，而这些水平目前的自适应模型并没有体现出来。学习。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号