arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.06340cs.GTcs.AIcs.LGcs.MAstat.ML
收藏

计算人类可理解的策略

Computing Human-Understandable Strategies

School of Computing and Information Sciences(计算与信息科学学院);Florida International University(佛罗里达国际大学)

Sam Ganzfried, Farzana Yusuf

摘要:

均衡计算的算法通常不试图确保计算出的策略是人类可以理解的。例如,最强的扑克代理的策略被表示为大量的二进制文件。在许多情况下,我们希望计算出人类可以实际实现的策略,人类可能有计算限制,并且可能只能记住已经计算出的策略的少量特征或组件。我们研究的扑克游戏中,私人信息的分布可以是任意的。我们通过随机选择信息概率创建了一个大型的游戏实例和解决方案训练集,并提出了从训练实例中学习的算法,以便在具有未知信息分布的游戏中表现良好。我们能够总结出几个关于扑克策略的新的基本规则,这些规则可以很容易地被人类实施。

英文摘要:

Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In many situations, we would like to compute strategies that can actually be implemented by humans, who may have computational limitations and may only be able to remember a small number of features or components of the strategies that have been computed. We study poker games where private information distributions can be arbitrary. We create a large training set of game instances and solutions, by randomly selecting the information probabilities, and present algorithms that learn from the training instances in order to perform well in games with unseen information distributions. We are able to conclude several new fundamental rules about poker strategy that can be easily implemented by humans.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑