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

We study coalitional values for games in generalized characteristic function form. There are two extensions of the Shapley value (Shapley (1953)) in this context, one introduced by Nowak and Radzik (1994) and the other introduced by us. We generalize both values to games with a priori unions in...

We consider the problem of a society whose members must choose from a finite set of alternatives. After knowing the chosen alternative, members may reconsider their membership. Thus, they must take into account, when voting, the effect of their votes not only on the chosen alternative but also...

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single- peaked preferences on an exogenously given interval of feasible allotments. We char- acterize axiomatically the family of extended...

We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists...