scholarly journals A Note on the Core of TU-cooperative Games with Multiple Membership Externalities

Games ◽  
2014 ◽  
Vol 5 (4) ◽  
pp. 191-203 ◽  
Author(s):  
Heinrich Nax
Keyword(s):  
Cooperative Games ◽  
The Core ◽  
Multiple Membership

On the core, nucleolus and bargaining sets of cooperative games with fuzzy payoffs

2019 ◽  
Vol 36 (6) ◽  
pp. 6129-6142 ◽  
Author(s):  
Xia Zhang ◽  
Hao Sun ◽  
Genjiu Xu ◽  
Dongshuang Hou
Keyword(s):  
Cooperative Games ◽  
The Core ◽  
Bargaining Sets

LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES

2002 ◽  
Vol 13 (05) ◽  
pp. 653-666 ◽  
Author(s):  
Qizhi Fang ◽  
Shanfeng Zhu
Keyword(s):  
Integer Programming ◽  
Cooperative Game ◽  
Cooperative Games ◽  
Value Function ◽  
Linear Program ◽  
Grand Coalition ◽  
The Core ◽  
Programming Techniques ◽  
Theoretical Results

Let Γ = (N, v) be a cooperative game with the player set N and value function v : 2N → R. A solution of the game is in the core if no subset of players could gain advantage by breaking away from the grand coalition of all players. This paper surveys theoretical results on the cores for some cooperative game models. These results proved that the linear program duality characterization of the core is a very powerful tool. We will focus on linear and integer programming techniques applied in this area.

scholarly journals The core and superdifferential of a fuzzy TU-cooperative game

2020 ◽  
Vol 12 (2) ◽  
pp. 20-35
Author(s):  
Валерий Александрович Васильев ◽  
Valery Vasil'ev
Keyword(s):  
Cooperative Game ◽  
Cooperative Games ◽  
Sufficient Conditions ◽  
Subdifferential Calculus ◽  
The Core ◽  
Side Payments ◽  
Weak Homogeneity ◽  
Fuzzy Game

In the paper, we consider conditions providing coincidence of the cores and superdifferentials of fuzzy cooperative games with side payments. It turned out that one of the most simple sufficient conditions consists of weak homogeneity. Moreover, by applying so-called S*-representation of a fuzzy game introduced by the author, we show that for any vwith nonempty core C(v) there exists some game u such that C(v) coincides with the superdifferential of u. By applying subdifferential calculus we describe a structure of the core forboth classic fuzzy extensions of the ordinary cooperative game (e.g., Aubin and Owen extensions) and for some new continuations, like Harsanyi extensions and generalized Airport game.

scholarly journals Hart–Mas-Colell consistency and the core in convex games

2021 ◽  
Author(s):  
Bas Dietzenbacher ◽  
Peter Sudhölter
Keyword(s):  
Shapley Value ◽  
Cooperative Games ◽  
Individual Rationality ◽  
Transferable Utility ◽  
Convex Games ◽  
The Core ◽  
The Shapley Value ◽  
Scale Covariance

AbstractThis paper formally introduces Hart–Mas-Colell consistency for general (possibly multi-valued) solutions for cooperative games with transferable utility. This notion is used to axiomatically characterize the core on the domain of convex games. Moreover, we characterize all nonempty solutions satisfying individual rationality, anonymity, scale covariance, superadditivity, weak Hart–Mas-Colell consistency, and converse Hart–Mas-Colell consistency. This family consists of (a) the Shapley value, (b) all homothetic images of the core with the Shapley value as center of homothety and with positive ratios of homothety not larger than one, and (c) their relative interiors.

scholarly journals Cooperative Games with Overlapping Coalitions

2010 ◽  
Vol 39 ◽  
pp. 179-216 ◽  
Author(s):  
G. Chalkiadakis ◽  
E. Elkind ◽  
E. Markakis ◽  
M. Polukarov ◽  
N. R. Jennings
Keyword(s):  
Coalition Formation ◽  
Cooperative Games ◽  
Cooperative Game Theory ◽  
Coalition Structure ◽  
Coalitional Games ◽  
The Core ◽  
Coalition Structures ◽  
Coalition Formation Process ◽  
The Social ◽  
Overlapping Coalitions

In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coalitions. However, in many domains where coalitions are associated with tasks, an agent may be involved in executing more than one task, and thus may distribute his resources among several coalitions. To tackle such scenarios, we introduce a model for cooperative games with overlapping coalitions—or overlapping coalition formation (OCF) games. We then explore the issue of stability in this setting. In particular, we introduce a notion of the core, which generalizes the corresponding notion in the traditional (non-overlapping) scenario. Then, under some quite general conditions, we characterize the elements of the core, and show that any element of the core maximizes the social welfare. We also introduce a concept of balancedness for overlapping coalitional games, and use it to characterize coalition structures that can be extended to elements of the core. Finally, we generalize the notion of convexity to our setting, and show that under some natural assumptions convex games have a non-empty core. Moreover, we introduce two alternative notions of stability in OCF that allow a wider range of deviations, and explore the relationships among the corresponding definitions of the core, as well as the classic (non-overlapping) core and the Aubin core. We illustrate the general properties of the three cores, and also study them from a computational perspective, thus obtaining additional insights into their fundamental structure.

Irrational-Behavior-Proof Conditions Based on Limit Characteristic Functions

2019 ◽  
Vol 7 (1) ◽  
pp. 1-16
Author(s):  
Cui Liu ◽  
Hongwei Gao ◽  
Ovanes Petrosian ◽  
Juan Xue ◽  
Lei Wang
Keyword(s):  
Characteristic Function ◽  
Cooperative Game ◽  
Shapley Value ◽  
Cooperative Games ◽  
Characteristic Functions ◽  
The Core ◽  
The Shapley Value ◽  
Irrational Behavior ◽  
The Individual

Abstract Irrational-behavior-proof (IBP) conditions are important aspects to keep stable cooperation in dynamic cooperative games. In this paper, we focus on the establishment of IBP conditions. Firstly, the relations of three kinds of IBP conditions are described. An example is given to show that they may not hold, which could lead to the fail of cooperation. Then, based on a kind of limit characteristic function, all these conditions are proved to be true along the cooperative trajectory in a transformed cooperative game. It is surprising that these facts depend only upon the individual rationalities of players for the Shapley value and the group rationalities of players for the core. Finally, an illustrative example is given.

The Core of Aggregative Cooperative Games with Externalities

2016 ◽  
Vol 16 (1) ◽  
pp. 389-410 ◽  
Author(s):  
Giorgos Stamatopoulos
Keyword(s):  
Normal Form ◽  
Characteristic Function ◽  
Coalition Formation ◽  
Cooperative Games ◽  
Grand Coalition ◽  
Normal Form Games ◽  
The Core ◽  
Aggregative Games ◽  
Games With Externalities

AbstractThis paper analyzes cooperative games with externalities generated by aggregative normal form games. We construct the characteristic function of a coalition S for various coalition formation rules and we examine the corresponding cores. We first show that the $$\gamma $$-core is non-empty provided each player’s payoff decreases in the sum of all players’ strategies. We generalize this result by showing that if S believes that the outside players form at least $$l(s) = n - s - (s - 1)$$ coalitions, then S has no incentive to deviate from the grand coalition and the corresponding core is non-empty (where n is the number of players in the game and s the number of members of S). We finally consider the class of linear aggregative games (Martimort and Stole 2010). In this case, if S believes that the outsiders form at least $$\widehat l(s) = {n \over s} - 1$$ coalitions [where $$\widehat l(s) \le l(s)$$] a core non-emptiness result holds again.

scholarly journals CONVEXITY IN STOCHASTIC COOPERATIVE SITUATIONS

2005 ◽  
Vol 07 (01) ◽  
pp. 25-42 ◽  
Author(s):  
JUDITH TIMMER ◽  
PETER BORM ◽  
STEF TIJS
Keyword(s):  
Shapley Value ◽  
Cooperative Games ◽  
Sufficient Conditions ◽  
Random Variables ◽  
Convex Game ◽  
Tu Games ◽  
New Model ◽  
The Core ◽  
Random Payoffs ◽  
Marginal Vectors

This paper introduces a new model concerning cooperative situations in which the payoffs are modeled by random variables. We analyze these situations by means of cooperative games with random payoffs. Special attention is paid to three types of convexity, namely coalitional-merge, individual-merge and marginal convexity. The relations between these types are studied and in particular, as opposed to their deterministic counterparts for TU games, we show that these three types of convexity are not equivalent. However, all types imply that the core of the game is nonempty. Sufficient conditions on the preferences are derived such that the Shapley value, defined as the average of the marginal vectors, is an element of the core of a convex game.

scholarly journals On the Core of Dynamic Cooperative Games

2013 ◽  
Vol 3 (3) ◽  
pp. 359-373 ◽  
Author(s):  
Ehud Lehrer ◽  
Marco Scarsini
Keyword(s):  
Cooperative Games ◽  
The Core
Sign in / Sign up

Export Citation Format

Share Document