The Core of Aggregative Cooperative Games with Externalities

2016 ◽  
Vol 16 (1) ◽  
pp. 389-410 ◽  
Author(s):  
Giorgos Stamatopoulos

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.

2002 ◽  
Vol 13 (05) ◽  
pp. 653-666 ◽  
Author(s):  
Qizhi Fang ◽  
Shanfeng Zhu

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.


2010 ◽  
Vol 39 ◽  
pp. 179-216 ◽  
Author(s):  
G. Chalkiadakis ◽  
E. Elkind ◽  
E. Markakis ◽  
M. Polukarov ◽  
N. R. Jennings

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.


2019 ◽  
Vol 67 (3-4) ◽  
pp. 185-195
Author(s):  
Kazuhiro Ohnishi

Which choice will a player make if he can make one of two choices in which his own payoffs are equal, but his rival’s payoffs are not equal, that is, one with a large payoff for his rival and the other with a small payoff for his rival? This paper introduces non-altruistic equilibria for normal-form games and extensive-form non-altruistic equilibria for extensive-form games as equilibrium concepts of non-cooperative games by discussing such a problem and examines the connections between their equilibrium concepts and Nash and subgame perfect equilibria that are important and frequently encountered equilibrium concepts.


2019 ◽  
Vol 7 (1) ◽  
pp. 1-16
Author(s):  
Cui Liu ◽  
Hongwei Gao ◽  
Ovanes Petrosian ◽  
Juan Xue ◽  
Lei Wang

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.


Sign in / Sign up

Export Citation Format

Share Document