具有区间支付的宗派对策

在区间不确定环境下,针对具有否决权的成员与其他成员之间的合作,建立了具有区间支付的宗派对策。在区间核心中,非宗派成员得到的区间分配不能超过他对大联盟的边际贡献。给出了完全区间宗派对策的等价条件。当相应的区间减法可行时,完全区间宗派对策的区间核心中的分配可以通过两种单调区间分配方案扩张得到。算例验证了模型的有效性。     

Connection problems in mountains and monotonic allocation schemes

Directed minimum cost spanning tree problems of a special kind are studied, namely those which show up in considering the problem of connecting units (houses) in mountains with a purifier. For such problems an easy method is described to obtain a minimum cost spanning tree. The related cost sharing problem is tackled by considering the corresponding cooperative cost game with the units as players and also the related connection games, for each unit one. The cores of the connection games have a simple structure and each core element can be extended to a population monotonic allocation scheme (pmas) and also to a bi-monotonic allocation scheme. These pmas-es for the connection games result in pmas-es for the cost game.     

Deposit games with reinvestment

In a deposit game coalitions are formed by players combining their capital. The proceeds of their investments then have to be divided among those players. The current model extends earlier work on capital deposits by allowing reinvestment of returns. Two specific subclasses of deposit games are introduced. These subclasses provide insight in two extreme cases. It is seen that each term dependent deposit game possesses a core element. Capital dependent deposit games are also shown to have a core element and even a population monotonic allocation scheme if the revenue function exhibits increasing returns to scale. Furthermore, it is shown that all superadditive games are deposit games if one allows for debt.     

Processing games with shared interest

This paper introduces processing problems with shared interest as an extension of processing situations with restricted capacities (Meertens, M., et al., Processing games with restricted capacities, 2004). Next to an individual capacity to handle jobs, each player now may have interest in the completion of more than one job, and the degrees of interest may vary among players. By cooperating the players can bundle their capacities and follow an optimal processing scheme to minimize total joint costs. The resulting cost allocation problem is analyzed by considering an associated cooperative cost game. An explicit core allocation of this game is provided.     

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

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

Common pool resources with support

We examine the role of support for coalition stability in common pool resource games such as fisheries games. Some players may not want to join a coalition that jointly manages a resource. Still, because they benefit from spillovers, they may want to support the coalition with a transfer payment to set incentives for others to join. We find that the impact of support on equilibria of this game is limited to games with three or five players. Recommendations for Resource Managers

• Coalitions may be able to effectively manage common pool resources such as fisheries but such coalitions are often not stable due to free-rider incentives.
• We explore the impact of a transfer scheme that can improve this coalition stability which would lead to larger and more effective coalitions.
• Our results show that this new transfer scheme works only for cases where the number of players is small.

     

Operations research games: A survey

This paper surveys the research area of cooperative games associated with several types of operations research problems in which various decision makers (players) are involved. Cooperating players not only face a joint optimisation problem in trying, e.g., to minimise total joint costs, but also face an additional allocation problem in how to distribute these joint costs back to the individual players. This interplay between optimisation and allocation is the main subject of the area of operations research games. It is surveyed on the basis of a distinction between the nature of the underlying optimisation problem: connection, routing, scheduling, production and inventory.     

Convex multi-choice games: Characterizations and monotonic allocation schemes

This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Furthermore, level-increase monotonic allocation schemes (limas) on the class of convex multi-choice games are introduced and studied. It turns out that each element of the Weber set of such a game is extendable to a limas, and the (total) Shapley value for multi-choice games generates a limas for each convex multi-choice game.     

An algorithm for computing the stable coalition structures in tree-graph communication games

We construct an algorithm which provides in finite steps the stable coalition structure(s) of tree-graph communication games and an allocation of the core: the restricted marginal contribution allocation. This paper has been presented at the St. Petersburg Institute for Economics and Mathematics (Russian Academy of Sciences), University of Santiago de Compostela (International Workshop on Game Theory), Universidad Autónoma de Barcelona, and Universidad de Sevilla. This research has been supported partially by: DGICYT PB94-1372 and UPV 035.321-HB146/96     

Weighted nucleoli

Cooperative games in characteristic function form (TU games) are considered. We allow for variable populations or carriers. Weighted nucleoli are defined via weighted excesses for coalitions. A solution satisfies the Null Player Out (NPO) property, if elimination of a null player does not affect the payoffs of the other players. For any single-valued and efficient solution, the NPO property implies the null player property. We show that a weighted nucleolus has the null player property if and only if the weights of multi-player coalitions are weakly decreasing with respect to coalition inclusion. Weighted nucleoli possessing the NPO-property can be characterized by means of a multiplicative formula for the weights of the multi-player coalitions and a restrictive condition on the weights of one-player coalitions. Received: March 1997/Final version: November 1998     

Multi-choice clan games and their core

In this paper, we consider market situations with two corners. One corner consists of a group of powerful agents with yes-or-no choices and clan behavior. The other corner consists of non-powerful agents with multi-choices regarding the extent at which cooperation with the clan can be achieved. Multi-choice clan games arise from such market situations. The focus is on the analysis of the core of multi-choice clan games. Several characterizations of multi-choice clan games by the shape of the core are given, and the connection between the convexity of a multi-choice clan game and the stability of its core is studied.      

有限制结盟的NTU对策解

对有限制结盟的NTU对策提出一种分配形式,即RC解,研究了这个解与对应的TU对策的有限制结盟边际贡献值之间的关系,同时给出RC解的刻划公理.     

最短路博弈群体单调分配方案构造

群体单调分配方案(Population Monotonic Allocation Scheme, 后简称PMAS)是合作博弈的一类分配机制。在合作博弈中, PMAS为每一个子博弈提供一个满足群体单调性的核中的分配方案, 从而保证大联盟的动态稳定性。本文主要贡献为利用线性规划与对偶理论构造与求解一类基于最短路问题的合作博弈(最短路博弈)的PMAS。我们首先借助对偶理论, 利用组合方法为最短路博弈构造了一个基于平均分摊思想的PMAS。然后借鉴计算核仁的Maschler方案, 将PMAS的存在性问题转化为一个指数规模的线性规划的求解问题, 并通过巧妙的求解得到了与之前组合方法相同的最短路博弈的PMAS。     

最短路博弈群体单调分配方案构造

群体单调分配方案(Population Monotonic Allocation Scheme, 后简称PMAS)是合作博弈的一类分配机制。在合作博弈中, PMAS为每一个子博弈提供一个满足群体单调性的核中的分配方案, 从而保证大联盟的动态稳定性。本文主要贡献为利用线性规划与对偶理论构造与求解一类基于最短路问题的合作博弈(最短路博弈)的PMAS。我们首先借助对偶理论, 利用组合方法为最短路博弈构造了一个基于平均分摊思想的PMAS。然后借鉴计算核仁的Maschler方案, 将PMAS的存在性问题转化为一个指数规模的线性规划的求解问题, 并通过巧妙的求解得到了与之前组合方法相同的最短路博弈的PMAS。     

Buyer-seller exactness in the assignment game

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the core of the game. These games will be called buyer-seller exact games and satisfy the condition that each mixed-pair coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyer-seller exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization of those assignment games which are buyer-seller exact in terms of the assignment matrix, attainable upper and lower core bounds for the mixed-pair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical representation of a “45^o-lattice” by means of the core of an assignment game can now be answered. Received: March 2002/Revised version: January 2003 RID="*" ID="*"  Institutional support from research grants BEC 2002-00642 and SGR2001-0029 is gratefully acknowledged RID="**" ID="**"  The authors thank the referees for their comments     

超图结构上合作博弈的赋权Position值

在合作博弈的一般模型中总是假设所有联盟都能形成。不过,在实际中由于受到一些因素的制约,有些联盟是不能形成的。基于此,Myerson提出了具有图通讯结构的合作博弈。Myerson值和Position值是超图博弈上的两个重要分配规则。2005年,Slikker给出了在图博弈上Position值的公理化刻画。但超图博弈上Position值的公理化刻画一直悬而未决。本文通过引入“赋权平衡超边贡献公理”,并结合经典的“分支有效性”,提出了超图博弈上赋权Position值的公理化刻画。作为推论,解决了超图博弈上Position值的公理化刻画问题。