In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion to enemies are...

This paper analyzes incentives for polluting firms to exchange abatement cost information under the non-linear pollution tax scheme ('differential tax') introduced by Kim and Chang [J. Regul. Econom. 5, 1993, 193-197]. It shows that polluting firms have - under mild conditions - an incentive to...

We adopt the largest consistent set defined by Chwe [J. of Econ. Theory 63 (1994), 299-235] to predict which coalition structures are possibly stable when players are farsighted. We also introduce a refinement, the largest cautious consistent set, based on the assumption that players are...

This paper reinterprets the ? -core (Chander and Tulkens (1995, 1997)) and justifies it as well as its prediction that the efficient coalition structure is stable in terms of the coalition formation theory. It is assumed that coalitions can freely merge or break apart, are farsighted (that is,...

Given a simple game, a power configuration specifies the power of each player in each winning coalition. We introduce a new power configuration which takes into account bargaining among players in coalitions. We show that under very weak conditions on a bargaining solution there is a power...

We consider a two-stage public goods provision game: In the first stage, players simultaneously decide if they will join a contribution group or not. In the second stage, players in the contribution group simultaneously offer contribution schemes in order to influence the government's choice on...

This paper first establishes a new core theorem using the concept of generated payoffs: the TU (transferable utility) core is empty if and only if the maximum of generated payoffs (mgp) is greater than the grand coalition's payoff v(N), or if and only if it is irrational to split v(N). It then...

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

We consider the class of proper monotonic simple games and study coalition formation when an exogenous share vector and a solution concept are combined to guide the distribution of coalitional worth. Using a multiplicative composite solution, we induce players' preferences over coalitions in a...