合作博弈的比例分离解及其在区域经济一体化中的应用

文章对合作博弈理论进行了研究,结合比例分配以及联盟形成过程,提出了比例分离解的概念.该解首先利用给定权重,基于回报率递减划分大联盟,得到了大联盟的适配划分,随后由适配划分确定的加入顺序对划分联盟的边际贡献按比例分配.然后,基于最高回报一致性对比例分离解的公理刻画进行了研究,得到了3个刻画定理.最后,将新的解概念应用到区域经济一体化问题中,建立了经济协同博弈模型,并以长三角地区为例,分析了该区域经济协同发展的贡献情况和发展规划.     

无限阶段网络博弈中合作解的策略稳定性

合作博弈的经典合作解不满足时间一致性, 并缺乏策略稳定性. 本文研究无限阶段网络博弈合作解的策略稳定性理论. 首先建立时间一致的分配补偿程序实现合作解的动态分配, 然后建立针对联盟的惩罚策略, 给出合作解能够被强Nash均衡策略支撑的充分性条件, 最后证明了博弈中的惩罚策略局势是强Nash均衡, 从而保证了合作解的策略稳定性. 作为应用, 考察了重复囚徒困境网络博弈中Shapley值的策略稳定性.     

图上合作博弈和图的边密度

1977年, Myerson建立了以图作为合作结构的可转移效用博弈模型(也称图博弈), 并提出了一个分配规则, 也即"Myerson 值", 它推广了著名的Shapley值. 该模型假定每个连通集合(通过边直接或间接内部相连的参与者集合)才能形成可行的合作联盟而取得相应的收益, 而不考虑连通集合的具体结构. 引入图的局部边密度来度量每个连通集合中各成员之间联系的紧密程度, 即以该连通集合的导出子图的边密度来作为他们的收益系数, 并由此定义了具有边密度的Myerson值, 证明了具有边密度的Myerson值可以由"边密度分支有效性"和"公平性"来唯一确定.     

基于平均树值的无圈图博弈有效解

本文对无圈图博弈进行了研究,考虑了大联盟收益不小于各分支收益之和的情况。通过引入剩余公平分配性质,也就是任意两个分支联盟的平均支付变化相等,给出了一个基于平均树值的无圈图博弈有效解。同时,结合有效性和分支公平性对该有效解进行了刻画。特别地,若无圈图博弈满足超可加性时,证明了该有效解一定是核中的元素,说明此时的解是稳定的。最后,通过一案例分析了该有效解的特点,即越大的分支分得的剩余越多,并且关键参与者,也就是具有较大度的参与者可获得相对多的支付。     

流域水资源分配纳什均衡实现过程的进化博弈分析

由于有限理性，流域不同地区在水资源数量与质量分配上就不像完全理性情况下分析的那样，一开始就能找到最好的对策来直接实现纳什均衡。本运用进化博弈理论，说明有限理性的流域不同地区能够通过不断地学习、协调，逐步地提高自己的理性程度并相应地调整对策，来达到一个具有一致性的水资源数量与质量分配的纳什均衡。本的结论可为流域管理机构制定相应的水资源管理政策提供理论依据。     

基于时滞效应的随机微分投资与比例再保险博弈

金融市场不断发展,激烈的市场竞争使得相对绩效比较在保险机构的业绩评估中占据越来越重要的地位。考虑历史业绩对公司决策的影响,引入时滞效应,研究时滞效应对具有竞争关系公司之间最优投资策略和最优再保险策略的影响。运用随机最优控制和微分博弈理论,针对Cramér-Lundberg模型,得到了均衡投资和再保险策略,给出了值函数的显式解;然后进一步针对近似扩散过程,求得指数效用下均衡投资策略和比例再保险策略的显式表达。通过数值算例,分析了最优均衡策略随模型各重要参数的动态变化。结论显示：保险公司在决策时是否将时滞信息纳入考虑之中将大大影响其投资和再保险行为。保险公司考虑较早时间财富值越多,其投资再保险行为就表现得越趋向于保守和谨慎;与之相反,如果保险公司对行业间的竞争越看重,其投资再保险策略就越倾向于冒险和激进。     

BNN动力学下一类连续博弈均衡解的存在性及稳定性

本文研究了一类连续博弈解的存在性及稳定性.利用BNN动力学理论和方法,将演化博弈论中的几个经典例子:鹰-鸽博弈、协调博弈和猜硬币博弈转化为连续型支付函数的连续博弈后,获得了鹰-鸽连续博弈的Nash平衡点是演化稳定和连续稳定的,推广了文献[8]中关于演化博弈Nash平衡点及稳定性结果.     

自相关过程的MUBM控制图

本文在UBM控制图(Unweighted Batch Means Chart)和Modified Shewhart控制图的基础上提出了适用于过程数据高度自相关且无模型假定的MUBM控制图(Modified Unweighted Batch Means Chart),通过随机模拟发现MUBM控制图比残差控制图(基于残差的Shewhart控制图)更加灵敏,并运用实例数据对MUBM控制图的设计作了说明。     

基于演化博弈视角下的加盟式快递合作稳定性分析

针对我国加盟式快递企业逐渐暴露出的加盟商服务质量低下、各自为政、总部管理薄弱等引发的双方合作不稳定问题, 本研究以演化博弈模型为主要理论工具, 开发了不完全信息下快递公司总部和加盟商的行为交互演化博弈系统。通过雅克比矩阵求解, 揭示了博弈初始条件改变以及决策参数取值变动对演化稳定结果的影响;然后以申通公司为例, 采用MATLAB软件进行了数值仿真分析。研究表明, 当加盟商积极合作所增加的收益、快递公司总部的罚金、信息不对称程度和监督成本位于不同阈值区间时, 系统分别呈现出三种演化稳定结果和一种周期性的随机状态, 同时发现快递单价对促进博弈双方的合作稳定性具有积极作用。最后, ①降低快递加盟商服务成本, 提高服务质量;②建立适度的违约惩罚制度, 完善利润分配机制;③加强平台信息共享, 促进信息透明化;④营造良好的竞争氛围, 避免无谓的价格战, 有助于引导系统向理想状态演化。     

我国既有多层住宅加装电梯费用分摊的合作博弈模型及其公理化刻画

本文结合我国当前城市既有多层住宅加装电梯费用分摊问题的实际,引入了具有联盟结构的赋权合作博弈模型。在该类博弈中,参与者将依据现实情况进行结盟,形成所谓的“优先联盟”。在此基础上,提出了被称为权分值的分摊规则,并证明了它可以由可加性、联盟内比例对称性、联盟间比例对称性和空化参与者性四个公理唯一确定。作为这个合作博弈模型的应用,本文将我国城市既有多层住宅加装电梯费用分摊问题可归结为具有联盟结构的赋权合作博弈模型,其中业主为参与者,而每一层的参与者们可看作一个优先联盟。当取适当的权值时,该分摊规则涵盖了我国大部分城市出台的既有多层住宅加装电梯业主费用分摊的指导标准,这为这些标准的完善、推广和实施提供了合理的理论依据。     

The Myerson value for directed graph games

A directed graph game consists of a cooperative game with transferable utility and a digraph which describes limited cooperation and the dominance relation among the players. Under the assumption that only coalitions of strongly connected players are able to fully cooperate, we introduce the digraph-restricted game in which a non-strongly connected coalition can only realize the sum of the worths of its strong components. The Myerson value for directed graph games is defined as the Shapley value of the digraph-restricted game. We establish axiomatic characterizations of the Myerson value for directed graph games by strong component efficiency and either fairness or bi-fairness.     

模糊联盟合作对策的平均树解

给出图对策中平均树解的拓展形式, 证明其是满足分支有效性和分支公平性的唯一解. 针对具有模糊联盟的图对策, 提出了一种模糊分配, 即模糊平均树解. 当模糊联盟图对策为完全图对策时, 模糊平均树解等于模糊Shapley值. 最后, 讨论了模糊平均树解与模糊联盟核心之间的关系, 并进行了实例论证.     

Tree,web and average web values for cycle-free directed graph games

On the class of cycle-free directed graph games with transferable utility solution concepts, called web values, are introduced axiomatically, each one with respect to a chosen coalition of players that is assumed to be an anti-chain in the directed graph and is considered as a management team. We provide their explicit formula representation and simple recursive algorithms to calculate them. Additionally the efficiency and stability of web values are studied. Web values may be considered as natural extensions of the tree and sink values as has been defined correspondingly for rooted and sink forest graph games. In case the management team consists of all sources (sinks) in the graph a kind of tree (sink) value is obtained. In general, at a web value each player receives the worth of this player together with his subordinates minus the total worths of these subordinates. It implies that every coalition of players consisting of a player with all his subordinates receives precisely its worth. We also define the average web value as the average of web values over all management teams in the graph. As application the water distribution problem of a river with multiple sources, a delta and possibly islands is considered.     

Asymmetric directed graph coloring games

This note generalizes the (a,b)-coloring game and the (a,b)-marking game which were introduced by Kierstead [H.A. Kierstead, Asymmetric graph coloring games, J. Graph Theory 48 (2005) 169-185] for undirected graphs to directed graphs. We prove that the (a,b)-chromatic and (a,b)-coloring number for the class of orientations of forests is b+2 if b≤a, and infinity otherwise. From these results we deduce upper bounds for the (a,b)-coloring number of oriented outerplanar graphs and of orientations of graphs embeddable in a surface with bounded girth.     

Asymmetric graph coloring games

We introduce the (a,b)‐coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a,b)‐marking game. We analyze these games and determine the (a,b)‐chromatic numbers and (a,b)‐coloring numbers for the class of forests and all values of a and b. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 169–185, 2005     

The bargaining set of four-person balanced games

It is well known that in three-person transferable-utility cooperative games the bargaining set ℳⁱ ₁ and the core coincide for any coalition structure, provided the latter solution is not empty. In contrast, five-person totally-balanced games are discussed in the literature in which the bargaining set ℳⁱ ₁ (for the grand coalition) is larger then the core. This paper answers the equivalence question in the remaining four-person case. We prove that in any four-person game and for arbitrary coalition structure, whenever the core is not empty, it coincides with the bargaining set ℳⁱ ₁. Our discussion employs a generalization of balancedness to games with coalition structures. Received: August 2001/Revised version: April 2002     

Values of games with graph restricted communication and a priori unions

Two new values for transferable utility games with graph restricted communication and a priori unions are introduced and characterized. Moreover, a comparison between these and the Owen graph value is provided. These values are used to analyze the distribution of power in the Basque Parliament emerging from elections in April 2005.