I adapt Raiffa's discrete bargaining solution in order to take the possibility of partial cooperation into account when there are more than two players. The approach is non-cooperative. I slightly modify the bargaining procedure proposed by Sjöström for supporting the Raiffa solution, exactly as Hart and MasColell introduced the possibility of partial cooperation in (a slight variation of) the ...

Two new values for transferable utility games with graph restricted communication and a priori unions are introduced and characterized. Moreover, a comparison between these and the Owen graph value is provided. These values are used to analyze the distribution of power in the Basque Parliament emerged from elections in April 2005.

Within the class of superadditive cooperative games with transferable utility, the convexity of a game is characterized by the coincidence of its core and the steady bargaining set. As a consequence it is also proved that convexity can also be characterized by the coincidence of the core of a game and the modified Zhou bargaining set (Shimomura, 1997)

We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be unifi...

We introduce a compromise value for non-transferable utility games: the Chi-compromise value. It is closely related to the Compromise value introduced by Borm, Keiding, McLean, Oortwijn, and Tijs (1992), to the MC-value introduced by Otten, Borm, Peleg, and Tijs (1998), and to the -value introduced by Berganti~ nos, CasasM endez, and V azquez-Brage (2000). The main di erence being that the maxi...

We provide a model of coalitional bargaining with claims in order to solve games with non-transferable utilities and externalities. We show that, for each such game, payoff configurations exist which will not be renegotiated. In the ordinal game derived from these payoff configurations, we can find a partition in which no group of players has an incentive to jointly change their coalitions. For...

We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on any coalition, for instance a network, a hierarchical ordering or a dominance relation. For every coalition the relative strength of a player within that coalition is induced by its social structure and is measured by a power function. We call a payoff vector socially stable if there ...

We provide a different axiomatization of the core interpreted as a reasonable set (Milnor, 1952) and introduce a new property, called max-intersection, related with the vector lattice structure of cooperative games with transferable utility. In particular, it is shown that the core is the only solution satisfying projection consistency, reasonability, max-intersection and modularity.

The strong Lorenz-core of a transferable utility game has a join-lattice structure on every rank-preserving region of the payoff set. The result unveils new properties on the arrangement of strong Lorenz-core allocations. As immediate corollaries we obtain complementary results to some findings of Dutta and Ray, Games Econ. Behav., 3(4) p.403-422 (1991), on constrained egalitarian allocations.

Coalition stability is an important concept in coalition formation. One common assumption in many stability criteria in non-transferable utility games is that the preference of each agent is publicly known, so that a coalition is said to be stable if there is no objections by any sub-group of agents according to the publicly known preferences. However, in many applications including some softwa...