arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.1475cs.AIcs.DMcs.GTcs.SC
收藏

如何正确修剪热带树木

How to correctly prune tropical trees

Université Paris 13(巴黎第十三大学);CNRS(法国国家科学研究中心)

Jean-Vincent Loddo, Luca Saiu

摘要:

我们提出了热带游戏,推广的组合最小最大游戏的基础上热带代数。我们的模型打破了理性零和游戏的传统对称性,其中玩家有完全相反的目标(最小与最大),比最小最大更广泛适用,也支持一种形式的修剪,尽管它不如α-β有效。实际上,最小-最大博弈可以被看作是博弈和它的对偶都是热带的特殊情况:当热带博弈的对偶也是热带的时候,α-β的力量就完全恢复了。我们正式开发的模型,并证明热带修剪策略是正确的,然后得出结论,显示如何近似解析的问题可以建模为一个热带游戏,从修剪中获利。

英文摘要:

We present tropical games, a generalization of combinatorial min-max games based on tropical algebras. Our model breaks the traditional symmetry of rational zero-sum games where players have exactly opposed goals (min vs. max), is more widely applicable than min-max and also supports a form of pruning, despite it being less effective than alpha-beta. Actually, min-max games may be seen as particular cases where both the game and its dual are tropical: when the dual of a tropical game is also tropical, the power of alpha-beta is completely recovered. We formally develop the model and prove that the tropical pruning strategy is correct, then conclude by showing how the problem of approximated parsing can be modeled as a tropical game, profiting from pruning.

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

↑