We present new axiomatic characterizations of the proportional Shapley value, a weighted TU-value with the worths of the singletons as weights. The presented characterizations are proportional counterparts to the famous characterizations of the Shapley value by Shapley and Young. We introduce two new axioms, called proportionality and player splitting, respectively. Each of them makes a main difference between the proportional Shapley value and the Shapley value. If the stand-alone worths are plausible weights, the proportional Shapley value is a convincing alternative (...) to the Shapley value, for example in cost allocation. Especially, the player splitting property, which states that players’ payoffs do not change if another player splits into two new players who have the same impact to the game as the original player, justifies the use of the proportional Shapley value in many economic situations. (shrink)

New and recent axioms for cooperative games with transferable utilities are introduced. The non-negative player axiom requires to assign a non-negative payoff to a player that belongs to coalitions with non-negative worth only. The axiom of addition invariance on bi-partitions requires that the payoff vector recommended by a value should not be affected by an identical change in worth of both a coalition and the complementary coalition. The nullified solidarity axiom requires that if a player who becomes null weakly loses (...) from such a change, then every other player should weakly lose too. We study the consequence of imposing some of these axioms in addition to some classical axioms. It turns out that the resulting values or set of values have all in common to split efficiently the worth achieved by the grand coalition according to an exogenously given weight vector. As a result, we also obtain new characterizations of the equal division value. (shrink)

A solution for cooperative games with transferable utility, or simply TU-games, assigns a payoff vector to every TU-game. In this paper we discuss two classes of equal surplus sharing solutions. The first class consists of all convex combinations of the equal division solution and the center-of-gravity of the imputation-set value. The second class is the dual class consisting of all convex combinations of the equal division solution and the egalitarian non-separable contribution value. We provide characterizations of the two classes of (...) solutions using either population solidarity or a reduced game consistency in addition to other standard properties. (shrink)

A situation, in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (point-valued) solution for TU-games assigns a payoff distribution to every TU-game. In this article we discuss a class of equal surplus sharing solutions consisting of all convex combinations of the CIS-value, the ENSC-value and the equal division solution. We provide several characterizations of this class of solutions on variable and fixed (...) player set. Specifications of several properties characterize specific solutions in this class. (shrink)

Cutting a cake, dividing up the property in an estate, determining the borders in an international dispute - such problems of fair division are ubiquitous. Fair Division treats all these problems and many more through a rigorous analysis of a variety of procedures for allocating goods, or deciding who wins on what issues, when there are disputes. Starting with an analysis of the well-known cake-cutting procedure, 'I cut, you choose', the authors show how it has been adapted in a number (...) of fields and then analyze fair-division procedures applicable to situations in which there are more than two parties, or there is more than one good to be divided. In particular they focus on procedures which provide 'envy-free' allocations, in which everybody thinks he or she has received the largest portion and hence does not envy anybody else. They also discuss the fairness of different auction and election procedures. (shrink)

The main purpose of this article is to introduce the weighted ENSC value for cooperative transferable utility games which takes into account players’ selfishness about the payoff allocations. Similar to Shapley’s idea of a one-by-one formation of the grand coalition [Shapley ], we first provide a procedural implementation of the weighted ENSC value depending on players’ selfishness as well as their marginal contributions to the grand coalition. Second, in the spirit of the nucleolus [Schmeidler ], we prove that the weighted (...) ENSC value is obtained by lexicographically minimizing a complaint vector associated with a new complaint criterion relying on players’ selfishness. (shrink)

We provide characterizations of the equal division values and their convex mixtures, using a new axiom on a fixed player set based on player nullification which requires that if a player becomes null, then any two other players are equally affected. Two economic applications are also introduced concerning bargaining under risk and common-pool resource appropriation.