We show that the Aumann-Davis-Maschler bargaining set and the Mas-Colell bargaining set of a non-leveled NTU game that is either ordinal convex or coalition merge convex coincides with the core of the game. Moreover, we show by means of an example that the foregoing statement may not be valid if...

On several classes of n-person NTU games that have at least one Shapley NTU value, Aumann characterized this solution by six axioms: Non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives (IIA). Each of the first five axioms is...

A strong representation of a committee, formalized as a simple game, on a convex and closed set of alternatives is a game form with the members of the committee as players such that (i) the winning coalitions of the simple game are exactly those coalitions, which can get any given alternative...

An effectivity function assigns to each coalition of individuals in a society a family of subsets of alternatives such that the coalition can force the outcome of society’s choice to be a member of each of the subsets separately. A representation of an effectivity function is a game form with...

The concept of coalition proof Nash equilibrium was introduced by Bernheim, Peleg, and Whinston [1987]. In the present paper, we consider the representation problem for coalition proof Nash equilibrium: For a given effectivity function, describing the power structure or the system of rights of...

This paper considers generalized Lorenz-maximal solutions in the core of a convex TU-game and demonsrtates that such solutions satisfy coalitional monotonicity and population monotonicity.

We introduce an extension of the Mas-Colell bargaining set and construct, by an elabo- ration on a voting paradox, a superadditive four-person nontransferable utility game whose extended bargaining set is empty. It is shown that this extension constitutes an upper hemi- continuous...

Let A be a finite set of m alternatives, let N be a finite set of n players and let R^N be a profile of linear preference orderings on A of the players. Let u^N be a profile of utility functions for R^N. We define the NTU game V_u^N that corresponds to simple majority voting, and investigate its...

Let A be a finite set of m <FONT FACE="Symbol">³</FONT> 3 alternatives, let N be a finite set of n <FONT FACE="Symbol">³</FONT> 3 players and let R<SUP>n</SUP> be a profile of linear preference orderings on A of the players. Throughout most of the paper the considered voting system is the majority rule. Let u<SUP>N</SUP> be a profile of utility functions for R<SUP>N</SUP>. Using...</sup></sup></sup></font></font>

A two-house legislature can often be modelled as a proper simple game whose outcome depends on whether a coalition wins, blocks or loses in two smaller proper simple games. It is shown that there are exactly five ways to combine the smaller games into a larger one. This paper focuses on one of...