A group of players in a cooperative game are partners (e.g., as in the form of a union or a joint ownership) if the prospects for cooperation are restricted such that cooperation with players outside the partnership requires the accept of all the partners. The formation of such partnerships...

The present paper considers rationing problems interpreted as e.g. bankruptcy problems or taxation problems. We demonstrate that among the continuous and order-preserving rationing methods, theproportional method is the only rationing method that preserves inequality in both gains and losses.

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...

Solutions for cooperative games with side-payments can be manipulated by merging a coalition of players into a single player, or, conversely, splitting a player into a number of smaller players. This paper establishes some (im-)possibility results concerning merging- or splitting-proofness of...

This paper suggests a simple approximation procedure for the assessment of productivity scores with respect to fuzzy production plans. The procedure has a clear economic interpretation and all the necessary calculations can be performed in a spreadsheet making it highly operational.

In this paper we consider a model of group formation where group of individuals may have different feasible sets. We focus on two polar cases, increasing returns, when the set of feasible alternatives increases if a new member joins thegroup, and decreasing returns, when a new member has an...

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...

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.

For n-person bargaining problems the family of proportional solutions (introduced and characterized by Kalai) is generalized to bargaining problems with non-convex payoff sets. The so-called "efficient proportional solutions" are characterized axiomatically using natural extensions of the...