【摘要】 在一个给定的拓扑网络中研究关于数据传输的二人随机博弈模型.两个局中人(源节点)试图通过一个公共节点向目的节点传输随机数据包,这些数据包被分为重要的数据包和不重要的数据包两类,假设每个局中人都有一个用于存储数据包的有限容量的缓冲器.通过构造数据传输的成本分摊和奖励体系,把这种动态的冲突控制过程建模为具有有限状态集合的随机博弈,研究局中人在这种随机博弈模型下的非合作以及合作行为.在非合作情形下,给出纳什均衡的求解算法;在合作情形下,选择Shapley值作为局中人支付总和的分配方案,并讨论其子博弈一致性,提出使得Shapley值为子博弈一致的分配补偿程序.更多还原

【Abstract】 Considering a stochastic game model of data transmission in a network of a given topology.Two players(source nodes) try to transmit packages to the destination node through a common node.These packages are divided into important packages and not important packages.Each player has a buffer of limited capacity to store packages.We define a system of cost and reward,and this dynamic conflict control process is modeled as stochastic game with a finite set of states.We study the non-cooperative and cooperative behaviors of players.We calculate the Nash equilibrium under the noncooperative situation.Shapley value is chosen as the solution of the cooperation game.We discuss the subgame consistency of Shapley value and propose a imputation distribution procedure.更多还原