合成博弈论,合成
Compositional Game Theory, Compositionally
摘要:
我们提出了一种新的组合方法,组合博弈论(CGT)的基础上箭头,一个概念,最初从函数式编程,密切相关的Tambara模块,和运营商建立新的箭头从旧的。我们将均衡建模为一个双模在一个箭头上,并定义一个操作符来构建一个新的箭头从这样一个双模在现有的箭头。我们还将策略建模为分级箭头,并定义了一个算子,该算子通过取分级箭头的上极限来构建新的箭头。一个final算子从一个分次双模构建一个分次Arrow。我们使用这种合成方法CGT显示如何已知和以前未知的开放游戏的变体可以被证明形成对称monoidal类别。
英文摘要:
We present a new compositional approach to compositional game theory (CGT) based upon Arrows, a concept originally from functional programming, closely related to Tambara modules, and operators to build new Arrows from old. We model equilibria as a bimodule over an Arrow and define an operator to build a new Arrow from such a bimodule over an existing Arrow. We also model strategies as graded Arrows and define an operator which builds a new Arrow by taking the colimit of a graded Arrow. A final operator builds a graded Arrow from a graded bimodule. We use this compositional approach to CGT to show how known and previously unknown variants of open games can be proven to form symmetric monoidal categories.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。