Fuzzy extensions of bargaining sets and their existence in cooperative fuzzy games

Recently, the concept of classical bargaining set given by Aumann and Maschler in 1964 has been extended to fuzzy bargaining set. In this paper, we give a modification to correct some weakness of this extension. We also extend the concept of the Mas-Colell's bargaining set (the other major type of bargaining sets) to its corresponding fuzzy bargaining set. Our main effort is to prove existence theorems for these two types of fuzzy bargaining sets. We will also give necessary and sufficient conditions for these bargaining sets to coincide with the Aubin Core in a continuous superadditive cooperative fuzzy game which has a crisp maximal coalition of maximum excess at each payoff vector. We show that both Aumann-Maschler and Mas-Colell fuzzy bargaining sets of a continuous convex cooperative fuzzy game coincide with its Aubin core.     

A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura)

Within the class of zero-monotonic games, we prove that a cooperative game with transferable utility is convex if and only if the core of the game coincides with the Mas-Colell bargaining set (à la Shimomura, in Int J Game Theory 26:283–302, 1997).     

The kernel and bargaining set for convex games

It is shown that for convex games the bargaining set? ₁ ⁽ⁱ⁾ (for the grand coalition) coincides with the core. Moreover, it is proved that the kernel (for the grand coalition) of convex games consists of a unique point which coincides with the nucleolus of the game.     

A new approach to the core and Weber set of multichoice games

Multichoice games have been introduced by Hsiao and Raghavan as a generalization of classical cooperative games. An important notion in cooperative game theory is the core of the game, as it contains the rational imputations for players. We propose two definitions for the core of a multichoice game, the first one is called the precore and is a direct generalization of the classical definition. We show that the precore coincides with the definition proposed by Faigle, and that the set of imputations may be unbounded, which makes its application questionable. A second definition is proposed, imposing normalization at each level, causing the core to be a convex compact set. We study its properties, introducing balancedness and marginal worth vectors, and defining the Weber set and the pre-Weber set. We show that the classical properties of inclusion of the (pre)core into the (pre)-Weber set as well as their coincidence in the convex case remain valid. A last section makes a comparison with the core defined by Van den Nouweland et al. A preliminary and short version of this paper has been presented at 4th Logic, Game Theory and Social Choice meeting, Caen, France, June 2005 (Xie and Grabisch 2005).     

On the vertices of the -additive core

The core of a game v on N, which is the set of additive games φ dominating v such that φ(N)=v(N), is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular functions, matroids and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define the k-additive core by replacing additive games by k-additive games in the definition of the core, where k-additive games are those games whose Möbius transform vanishes for subsets of more than k elements. For a sufficiently high value of k, the k-additive core is nonempty, and is a convex closed polyhedron. Our aim is to establish results similar to the classical results of Shapley and Ichiishi on the core of convex games (corresponds to Edmonds’ theorem for the greedy algorithm), which characterize the vertices of the core.     

On some families of cooperative fuzzy games

In a fuzzy cooperative game the players may choose to partially participate in a coalition. A fuzzy coalition consists of a group of participating players along with their participation level. The characteristic function of a fuzzy game specifies the worth of each such coalition. This paper introduces well-known properties of classical cooperative games to the theory of fuzzy games, and studies their interrelations. It deals with convex games, exact games, games with a large core, extendable games and games with a stable core.     

The inequalities that determine the bargaining setM 1 (i)

It is well-known that the payoffs of the various bargaining sets of a cooperativen-person game are finite unions of closed convex polyhedra. In this paper, the system of inequalities that determines these polyhedra for the bargaining setM ₁ ⁽ⁱ⁾ is expressed in explicit form. It turns out that this system also expresses the condition that certain games, derived from the original game and from the potential payoffs, have full-dimensional cores.     

基于模糊博弈视角的企业联盟“双循环”合作对策研究

企业合作在“双循环”新发展格局下呈现出更多的模糊特征,能否形成稳定的模糊合作格局及持续合作的收益再分配策略成为合作联盟的关注点。将广义模糊超量博弈和模糊凸博弈及其广义解集应用到“双循环”新发展格局下企业联盟合作与收益再分配中,提出最大广义模糊超量博弈模型及其广义模糊谈判集,并基于最大广义模糊超量博弈均衡性的视角,对模糊凸博弈下广义模糊谈判集与核心的等价性质进行论证。研究结果不仅满足了“双循环”新发展格局下合作企业以部分资源参与合作的意愿,及企业联盟模糊凸合作博弈下再分配方案等价性证明需求,而且实现了保留部分收益用于联盟再发展的策略。     

A cardinal bargaining set for games without side payments

A bargaining set for games without side payments, based on cardinal considerations is introduced. It is proved that it is never empty for a fairly general class of games without side payments, that it coincides with the classical bargaining set if the game has side payments and that it is a subset of an ordinal bargaining set described inAsscher [1975a].     

Dynamic realization games in newsvendor inventory centralization

Consider a set N of n (> 1) stores with single-item and single-period nondeterministic demands like in a classic newsvendor setting with holding and penalty costs only. Assume a risk-pooling single-warehouse centralized inventory ordering option. Allocation of costs in the centralized inventory ordering corresponds to modelling it as a cooperative cost game whose players are the stores. It has been shown that when holding and penalty costs are identical for all subsets of stores, the game based on optimal expected costs has a non empty core (Hartman et al. 2000, Games Econ Behav 31:26–49; Muller et al. 2002, Games Econ Behav 38:118–126). In this paper we examine a related inventory centralization game based on demand realizations that has, in general, an empty core even with identical penalty and holding costs (Hartman and Dror 2005, IIE Trans Scheduling Logistics 37:93–107). We propose a repeated cost allocation scheme for dynamic realization games based on allocation processes introduced by Lehrer (2002a, Int J Game Theor 31:341–351). We prove that the cost subsequences of the dynamic realization game process, based on Lehrer’s rules, converge almost surely to either a least square value or the core of the expected game. We extend the above results to more general dynamic cost games and relax the independence hypothesis of the sequence of players’ demands at different stages.     

Information market games

In this paper information markets with perfect patent protection and only one initial owner of the information are studied by means of cooperative game theory. To each information market of this type a cooperative game with sidepayments is constructed. These cooperative games are called information (market) games. The set of all information games with fixed player set is a cone in the set of all cooperative games with the same player set. Necessary and sufficient conditions are given in order that a cooperative game is an information game. The core of this kind of games is not empty and is also the minimal subsolution of the game. The core is the image of an (n-1)-dimensional hypercube under an affine transformation, (= hyperparallellopiped), the nucleolus and -value coincide with the center of the core. The Shapley value is computed and may lie inside or outside the core. The Shapley value coincides with the nucleolus and the -value if and only if the information game is convex. In this case the core is also a stable set.     

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     

基于Choquet积分形式的模糊联盟核心

在具有联盟结构的合作对策中,针对局中人以某种程度参与到合作中的情况,研究了模糊联盟结构的合作对策的收益分配问题。首先,定义了具有模糊联盟结构的合作对策及相关概念。其次,定义了Choquet积分形式的模糊联盟核心,提出了该核心与联盟核心之间的关系,对于强凸联盟对策,证明Choquet积分形式的模糊Owen值属于其所对应的模糊联盟核心。最后通过算例,对该分配模型的可行性进行分析。     

Cores of non-atomic market games

We study the cores of non-atomic market games, a class of transferable utility cooperative games introduced by Aumann and Shapley (Values of non-atomic games, 1974), and, more in general, of those games that admit a na-continuous and concave extension to the set of ideal coalitions, studied by Einy et al. (Int J Game Theory 28:1–14, 1999). We show that the core of such games is norm compact and some related results. We also give a Multiple Priors interpretation of some of our findings.     

A convex representation of totally balanced games

We analyze the least increment function, a convex function of n variables associated to an n-person cooperative game. Another convex representation of cooperative games, the indirect function, has previously been studied. At every point the least increment function is greater than or equal to the indirect function, and both functions coincide in the case of convex games, but an example shows that they do not necessarily coincide if the game is totally balanced but not convex. We prove that the least increment function of a game contains all the information of the game if and only if the game is totally balanced. We also give necessary and sufficient conditions for a function to be the least increment function of a game as well as an expression for the core of a game in terms of its least increment function.     

The Shapley function for fuzzy cooperative games with multilinear extension form

In this paper, the definition of the Shapley function for fuzzy cooperative games is given, which is obtained by extending the classical case. The specific expression of the Shapley function for fuzzy cooperative games with multilinear extension form is given, and its existence and uniqueness are discussed. Furthermore, the properties of the Shapley function are researched. Finally, the fuzzy core for this kind of game is defined, and the relationship between the fuzzy core and the Shapley function is shown.     

<Emphasis Type="Italic">p</Emphasis>-additive games: a class of totally balanced games arising from inventory situations with temporary discounts

We introduce a new class of totally balanced cooperative TU games, namely p-additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo Ph.D. thesis, Universidad Miguel Hernández de Elche, 2002) and contains the class of inventory cost games (Meca et al. Math. Methods Oper. Res. 57:481–493, 2003). It is shown that every p-additive game and its corresponding subgames have a nonempty core. We also focus on studying the character of concave or convex and monotone p-additive games. In addition, the modified SOC-rule is proposed as a solution for p-additive games. This solution is suitable for p-additive games, since it is a core-allocation which can be reached through a population monotonic allocation scheme. Moreover, two characterizations of the modified SOC-rule are provided. This work was partially supported by the Spanish Ministry of Education and Science and Generalitat Valenciana (grants MTM2005-09184-C02-02, ACOMP06/040, CSD2006-00032). Authors acknowledge valuable comments made by the Editor and the referee.     

Convex covers of symmetric games

We consider a multi-player, cooperative, transferable-utility, symmetric game (N, v) and associated convex covers, i.e., convex games (N, v) such thatv≥ v. A convex cover isefficient iffv(?)=v(?) andv(N)=v(N); andminimal iff there is no convex coverv ≠ v such thatv ≤ v. Efficient and minimal convex covers are closely related to the core of (N, v); in fact, extreme points of the core are shown to correspond to efficient convex covers which are minimal and extreme. A necessary and sufficient condition is provided for minimality, and another for extremity. Construction of convex covers and a form of decomposition are treated in detail, and some useful properties are identified which may be recognized in terms of visibility of points on a graph of (N, v) and other elementary concepts.