Two-step coalition values for multichoice games

We introduce and compare several coalition values for multichoice games. Albizuri defined coalition structures and an extension of the Owen coalition value for multichoice games using the average marginal contribution of a player over a set of orderings of the player’s representatives. Following an approach used for cooperative games, we introduce a set of nested or two-step coalition values on multichoice games which measure the value of each coalition and then divide this among the players in the coalition using either a Shapley or Banzhaf value at each step. We show that when a Shapley value is used in both steps, the resulting coalition value coincides with that of Albizuri. We axiomatize the three new coalition values and show that each set of axioms, including that of Albizuri, is independent. Further we show how the multilinear extension can be used to compute the coalition values. We conclude with a brief discussion about the applicability of the different values.     

Random order coalition structure values

Recently, attention has been focused on generalizations of the Shapley value obtained by relaxing the symmetry postulate. Shapley defined the class of weighted values and these have been characterized by Kalai and Samet. Random order values, treated by Weber, provide the most general approach to values without symmetry. This paper extends the random order idea to games with coalition structures. The symmetric CS value was defined by Owen; axiomatic characterizations have been given by Owen and Hart and Kurz. Levy and McLean extended their work and analyzed various classes of weighted CS values. The random order CS values of this paper include all the CS values described above as special cases.     

An axiomatization of probabilistic Owen value for games with coalition structure

In the framework of games with coalition structure, we introduce probabilistic Owen value which is an extension of the Owen value and probabilistic Shapley value by considering the situation that not all priori unions are able to cooperate with others. Then we use five axioms of probabilistic efficiency, symmetric within coalitions, symmetric across coalitions applying to unanimity games, strong monotone property and linearity to axiomatize the value.     

The Shapley value for cooperative games under precedence constraints

Cooperative games are considered where only those coalitions of players are feasible that respect a given precedence structure on the set of players. Strengthening the classical symmetry axiom, we obtain three axioms that give rise to a unique Shapley value in this model. The Shapley value is seen to reflect the expected marginal contribution of a player to a feasible random coalition, which allows us to evaluate the Shapley value nondeterministically. We show that every exact algorithm for the Shapley value requires an exponential number of operations already in the classical case and that even restriction to simple games is #P-hard in general. Furthermore, we outline how the multi-choice cooperative games of Hsiao and Raghavan can be treated in our context, which leads to a Shapley value that does not depend on pre-assigned weights. Finally, the relationship between the Shapley value and the permission value of Gilles, Owen and van den Brink is discussed. Both refer to formally similar models of cooperative games but reflect complementary interpretations of the precedence constraints and thus give rise to fundamentally different solution concepts.     

The collective value: a new solution for games with coalition structures

In this study, we provide a new solution for cooperative games with coalition structures. The collective value of a player is defined as the sum of the equal division of the pure surplus obtained by his coalition from the coalitional bargaining and of his Shapley value for the internal coalition. The weighted Shapley value applied to a game played by coalitions with coalition-size weights is assigned to each coalition, reflecting the size asymmetries among coalitions. We show that the collective value matches exogenous interpretations of coalition structures and provide an axiomatic foundation of this value. A noncooperative mechanism that implements the collective value is also presented.     

Axiomatizations of the Shapley value for games on augmenting systems

This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of unallowable coalitions. Games restricted by a communication graph were introduced by Myerson and Owen. In their model, the feasible coalitions are those that induce connected subgraphs. Another type of model is introduced in Gilles, Owen and van den Brink. In their model, the possibilities of coalition formation are determined by the positions of the players in a so-called permission structure. Faigle proposed another model for cooperative games defined on lattice structures. We introduce a combinatorial structure called augmenting system which is a generalization of the antimatroid structure and the system of connected subgraphs of a graph. In this framework, the Shapley value of games on augmenting systems is introduced and two axiomatizations of this value are showed.     

具有区间联盟值n人对策的Shapley值

本文提出了一类具有区间联盟收益值n人对策的Shapley值.利用区间数运算有关理论,通过建立公理化体系,对具有区间联盟收益值n人对策的Shapley值进行深入研究,证明了这类n人对策Shapley值存在性与唯一性,并给出了此Shapley值的具体表达式及一些性质.最后通过一个算例检验了其有效性与正确性.     

Owen coalitional value without additivity axiom

We show that the Owen value for TU games with coalition structure can be characterized without the additivity axiom similarly as it was done by Young for the Shapley value for general TU games. Our axiomatization via four axioms of efficiency, marginality, symmetry across coalitions, and symmetry within coalitions is obtained from the original Owen’s one by the replacement of additivity and null-player via marginality. We show that the alike axiomatization for the generalization of the Owen value suggested by Winter for games with level structure is valid as well. The research was supported by NWO (The Netherlands Organization for Scientific Research) grant NL-RF 047.017.017.     

基于联盟结构的模糊合作博弈的收益分配方案

研究了具有联盟结构的企业联盟模糊情况下各局中人的收益分配问题.首先拓展了Owen联盟值在经典意义下满足的5个公理,利用Choquet积分给出了基于联盟结构的模糊合作博弈的Owen联盟值,即模糊Owen联盟值的具体形式,并证明该联盟值满足新定义的5个公理.最后用实例验证了模糊Owen联盟值方法,并对计算结果进行分析。     

Shapley值与Winter值的解析关系

鉴于 Shapley 值和 Winter 值都是局中人边际贡献的平均值,探究了它们之 间的解析关系.证明了 Shapley 值是 Winter 值在层次结构集上对称概率分布下的期望均值. 作为这一结论的一个推论, 证明了 Shapley 值是 Winter 值在层次结构集的任意相似类中的平均值. 最后,还指出了这一结 论与推论的等价性.研究结果不仅扩展了 Shapley 值和 Owen 值与此对应的解析关系, 还大大简化了这些关系的已有证明.     

A new basis and the Shapley value

The purpose of this paper is to introduce a new basis of the set of all TU games. Shapley (1953) introduced the unanimity game in which cooperation of all players in a given coalition yields payoff. We introduce the commander game in which only one player in a given coalition yields payoff. The set of the commander games forms a basis and has two properties. First, when we express a game by a linear combination of the basis, the coefficients related to singletons coincide with the Shapley value. Second, the basis induces the null space of the Shapley value.     

一类具有限制联盟结构的合作对策的两阶段Shapley值

讨论一类具有限制联盟结构的合作对策,其中局中人通过优先联盟整体参与大联盟的合作,同时优先联盟内部有合取权限结构限制,利用两阶段Shapley值的分配思想并考虑到权限结构对优先联盟内合作的限制,给出了此类合作对策的解。 该解可看做具有联盟结构的合作对策的两阶段Shapley值的推广。 证明了该解满足的公理化条件,并验证了这些条件的独立性。     

基于Choquet积分的直觉模糊联盟合作博弈的Shapley值

本文针对联盟是直觉模糊集的合作博弈Shapley值进行了研究.通过区间Choquet积分得到直觉模糊联盟合作博弈的特征函数为区间数,并研究了该博弈特征函数性质。根据拓展模糊联盟合作博弈Shapley值的计算方法,得到直觉模糊联盟合作博弈Shapley值的计算公式,该计算公式避免了区间数的减法。进一步证明了其满足经典合作博弈Shapley值的公理性。最后通过数值实例说明本文方法的合理性和有效性。     

一种资源投入不确定情形下的合作博弈形式及收益分配策略

首先,将经典合作博弈进行扩展,提出了一类模糊联盟合作博弈的通用形式,涵盖常见三种模糊联盟合作博弈,即多线性扩展博弈、比例模糊博弈与Choquet积分模糊博弈.比例模糊博弈、Choquet积分模糊博弈的Shapley值均可以作为一种特定形式下模糊联盟合作博弈的收益分配策略,但是对于多线性扩展博弈的Shapley值一直关注较少,因此利用经典Shapley值构造出多线性扩展博弈的Shapley值,以此作为一种收益分配策略.最后,通过实例分析了常见三类模糊联盟合作博弈的形式及其对应的分配策略,分析收益最大的模糊联盟合作对策形式及最优分配策略,为不确定情形下的合作问题提供了一定的收益分配依据.     

博弈联盟模糊收益的分配

提出了联盟模糊收益合理分配的一种新方法.首先,在模糊收益α截集上定义了α合理分配集,分析了该分配集与模糊收益Shapley值的关系.接着,给出了模糊收益的α合理Shapley分配函数,对其性质进行了讨论.然后,构造了模糊合理Shapley分配,证明其连续性,得到了联盟模糊收益与模糊合理Shapley分配具有包含关系的结论.     

A Shapley function on a class of cooperative fuzzy games

In this paper, we make a study of the Shapley values for cooperative fuzzy games, games with fuzzy coalitions, which admit the representation of rates of players' participation to each coalition. A Shapley function has been introduced by another author as a function which derives the Shapley value from a given pair of a fuzzy game and a fuzzy coalition. However, the previously proposed axioms of the Shapley function can be considered unnatural. Furthermore, the explicit form of the function has been given only on an unnatural class of fuzzy games. We introduce and investigate a more natural class of fuzzy games. Axioms of the Shapley function are renewed and an explicit form of the Shapley function on the natural class is given. We make sure that the obtained Shapley value for a fuzzy game in the natural class has several rational properties. Finally, an illustrative example is given.     

The Owen value values friendship

This paper presents two new axiomatizations of the Owen value for games with coalition structures. Two associated games are defined and a consistency axiom is required. The construction of the associated games presupposes that coalitions behave in an aggressive manner towards players who are not members of the same unions and in a friendly manner towards players that do belong to their unions. The consistency axiom necessitates the definition of only one associated game which is not a reduced game. Received: February 1999/Revised version: January 2000     

基于区间与模糊Shapley值的合作收益分配策略

将经典Shapley值三条公理进行拓广,提出具有模糊支付合作对策的Shapley值公理体系。研究一种特殊的模糊支付合作对策,即具有区间支付的合作对策,并且给出了该区间Shapley值形式。根据模糊数和区间数的对应关系,提出模糊支付合作对策的Shapley值,指出该模糊Shapley值是区间支付模糊合作对策的自然模糊延拓。结果表明:对于任意给定置信水平α,若α=1,则模糊Shapley值对应经典合作对策的Shapley值,否则对应具有区间支付合作对策的区间Shapley值。通过模糊数的排序,给出了最优的分配策略。由于对具有模糊支付的合作对策进行比较系统的研究,从而为如何求解局中人参与联盟程度模糊化、支付函数模糊化的合作对策,奠定了一定的基础。     

A general procedure to compute mixed modified semivalues for cooperative games with structure of coalition blocks

Semivalues are solution concepts for cooperative games that assign to each player a weighted sum of his/her marginal contributions to the coalitions, where the weights only depend on the coalition size. The Shapley value and the Banzhaf value are semivalues. Mixed modified semivalues are solutions for cooperative games when we consider a priori coalition blocks in the player set. For all these solutions, a computational procedure is offered in this paper.