双边配给问题的Shapley解及其在博物馆通票问题中的应用

双边配给问题描述了现实生活中一类带有二部图结构的稀缺资源配置问题, 例如, 在自然灾害期间救援物资的配给; 电力和天然气等自然资源按需分配; 高校引进人才调配等。本文通过求解线性规划, 并从联盟边际贡献的角度出发定义了双边配给问题的一个Shapley解。之后, 通过合作对策模型和解的公理化方法说明新解的合理性。首先, 建立双边配给问题的合作对策模型, 论证了新解与双边配给合作对策的Shapley值一致; 其次, 证明了Shapley解是唯一满足优先一致性的有效配给方案。最后, 将Shapley解应用于博物馆通票问题的研究, 探讨了博物馆合作制定通票后所得单票和通票收益的分配方式。     

拟阵限制下合作对策解的传递性

Vincent Feltkamp研究了Shapley解和Banzhaf解的公理性．Bilbao等人又对拟阵限制下的Shapley解的性质进行了讨论．本文在此基础上主要研究了拟阵限制下的合作对策Shapley解，并利用传递性、交换性、概率有效性和P-哑元性等四条公理证明了拟阵限制下合作对策Shapley解的唯一性．进而证明了拟阵限制条件下简单对策Shapley解的唯一性．最后给出了拟阵限制下合作对策的Banzhaf解的唯一性定理．     

合作对策的改进Shapley解

本文根据经典合作对策Shapley解的适用范围提出了改进Shapley解,且改进Shapley解更能描述现实生活中的一类经济现象.同时利用与刻画经典合作对策Shapley解类似的几个公理刻画了改进Shapley解.并将改进Shapley解的分配方法应用到了协调利益分配的实例中.     

模糊联盟合作对策的收益分配研究

针对现实环境中联盟组成的不确定性, 本文研究了具有模糊联盟的合作对策求解问题。提出了模糊联盟合作对策的一种新的分配方式,即平均分摊解,并给出了这种解与模糊联盟合作对策Shapley值一致的充分条件。同时,还提出了模糊联盟合作对策的Shapley值的一个重要性质。最后,结合算例进行了分析论证。     

拟阵上合作对策的单调解

本文主要介绍了拟阵上的合作对策Shapley解的结构,并利用强单调性、交换性、概率有效性等三条公理刻画了拟阵上合作对策Shapley解的唯-性.同时讨论了本文的三条公理与Bilbao等人的四条 公理的等价性.最后给出拟阵上合作对策核心的定义及其结构.     

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

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

直觉模糊支付合作对策的Shapley值

主要研究支付值是直觉模糊数的合作对策Shapley值的问题.首先在直觉模糊支付合作对策的基础上,定义了直觉模糊支付函数的截集及直觉模糊合作对策的截集分配;其次将经典的Shapley函数满足的三条公理进行拓展,并构造了直觉模糊Shapley值;最后通过一个算例来验证该方法的有效性。     

指派问题的多重最优解的择优方法

在某些情况下,经典指派问题的最优解不唯一．不同的最优解对参与人的影响不同,导致每个参与人会争取最有利于自身的最优解．为解决这个问题,通过研究允许合作指派问题的合作对策解的形成,提出允许合作指派问题的讨价还价模型和个体理性激励函数．在此基础上,提出了一个考虑个体理性的指派问题多重最优解的择优方法,从而保证了指派问题最优解的唯一性．     

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

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

残缺模糊合作对策的加权Shapley值

针对具有模糊联盟且支付值残缺的合作对策问题,给出了E-残缺模糊对策的定义.基于残缺联盟值基数集,提出了一个同时满足对称性和线性性的w-加权Shapley值公式.通过构造模糊联盟间的边际贡献,探讨了w-加权Shapley值公式的等价表示形式,指出w-加权Shapley值与完整合作对策Shapley值的兼容性.在模糊联盟框架里,探讨了w-加权Shapley值所满足的联盟单调性、零正则性等优良性质.最后通过算例验证了该公式的有效性.     

Multi-commodity rationing problems with maxmin payoffs

We address a multi-dimensional extension of standard rationing problems in which several commodities have to be shared among a set of agents who exhibit maxmin preferences on the results they obtain. In this context we investigate efficiency and introduce a property of stability which is supported on a transferable utility game. We also propose a procedure to construct rules for obtaining stable allocations for the special case where all commodities have the same weight.     

Conference structures and fair allocation rules

To describe how the outcome of a cooperative game might depend on which groups of players hold cooperative planning conferences, we study allocation rules, which are functions mapping conference structures to payoff allocations. An allocation rule is fair if every conference always gives equal benefits to all its members. Any characteristic function game without sidepayments has a unique fair allocation rule. The fair allocation rule also satisfies a balanced contributions formula, and is closely related to Harsanyi's generalized Shapley value for games without sidepayments. If the game is superadditive, then the fair allocation rule also satisfies a stability condition.     

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.     

Modeling cooperation on a class of distribution problems

In this paper we study models of cooperation between the nodes of a network that represents a distribution problem. The distribution problem we propose arises when, over a graph, a group of nodes offers certain commodity, some other nodes require it and a third group of nodes neither need this material nor offer it but they are strategically relevant to the distribution plan. The delivery of one unit of material to a demand node generates a fixed profit, and the shipping of the material through the arcs has an associated cost. We show that in such a framework cooperation is beneficial for the different parties. We prove that the cooperative situation arising from this distribution problem is totally balanced by finding a set of stable allocations (in the core of an associated cooperative game). In order to overcome certain fairness problems of these solutions, we introduce two new solution concepts and study their properties.     

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

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

The equivalence of uniform and Shapley value-based cost allocations in a specific game

This paper concerns the possible equivalence of the Shapley value and other allocations in specific games. For a group buying game with a linear quantity discount schedule, the uniform allocation results in the same cost allocation as the Shapley value. In this paper, we explore whether the Shapley axioms can be used to make such connections. We also characterize the functions that result in the equivalence of these two allocations among the class of polynomial total cost functions.     

On the serial cost sharing rule

In this paper we study a solution for discrete cost allocation problems, namely, the serial cost sharing method. We show that this solution can be computed by applying the Shapley value to an appropriate TU game and we present a probabilistic formula. We also define for cost allocation problems a multilinear function in order to obtain the serial cost sharing method as Owen (1972) did for the Shapley value in the cooperative TU context. Moreover we show that the pseudo average cost method is equivalent to an extended Shapley value. Received April 2000/Revised January 2003 RID="*" ID="*"  Authors are indebted to two anonymous referees for especially careful and useful comments. This research has been partially supported by the University of the Basque Country (projects UPV 036.321-HA197/98, UPV 036.321-HA042/99) and DGES Ministerio de Educación y Ciencia (project PB96-0247).     

Shapley mappings and the cumulative value for n-person games with fuzzy coalitions

In this paper we prove existence and uniqueness of the so-called Shapley mapping, which is a solution concept for a class of n-person games with fuzzy coalitions whose elements are defined by the specific structure of their characteristic functions. The Shapley mapping, when it exists, associates to each fuzzy coalition in the game an allocation of the coalitional worth satisfying the efficiency, the symmetry, and the null-player conditions. It determines a “cumulative value” that is the “sum” of all coalitional allocations for whose computation we provide an explicit formula.     

Weighted allocation rules for standard fixed tree games

In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in Maschler et al. (1995) . We show, in a constructive way, that the core equals both the set of weighted down-home allocations and the set of weighted neighbour allocations. Since every weighted down-home allocation specifies a weighted Shapley value (Kalai and Samet (1988)) in a natural way, and vice versa, our results provide an alternative proof of the fact that the core of a standard fixed tree game equals the set of weighted Shapley values. The class of weighted neighbour allocations is a generalization of the nucleolus, in the sense that the latter is in this class as the special member where players have all equal weights.