首页> 外文OA文献 >Information Protocols and Extensive Games in Inductive Game Theory
【2h】

Information Protocols and Extensive Games in Inductive Game Theory

机译:归纳博弈论中的信息协议与广义博弈

摘要

We introduce a new mathematical representation of an extensive game situation,called an information protocol, without using the hypothetical underlying structureof nodes and branches. Its necessity has been emerging in our study of inductivegame theory. It has two main differences from a standard extensive game: one is theuse of information pieces (symbolic expressions) rather than information sets, andthe other is the replacement of a game tree by a causal relation. We will give a set ofaxioms to show that our new formulation is equivalent to an extensive game. Also,by deleting some axioms, we can capture some weaker forms of extensive games,which are crucial to describing inductive game theory. Some theoretical resultsfor inductive game theory become drastically simplified in the present formulationrelative to previous formulations by the authors relying on extensive games.
机译:我们引入了一种广泛的博弈情况的新数学表示形式,称为信息协议,而没有使用节点和分支的假设基础结构。在我们对归纳游戏理论的研究中,它的必要性已经出现。它与标准的广泛游戏有两个主要区别:一个是使用信息(符号表达)而不是信息集,另一个是使用因果关系代替游戏树。我们将给出一组轴心,以表明我们的新公式等同于广泛的游戏。此外,通过删除一些公理,我们可以捕获一些较弱形式的博弈,这对于描述归纳博弈论至关重要。相对于以前的公式,归纳博弈理论的一些理论结果由于依赖广泛博弈的作者而大大简化。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号