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

We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions...

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 characterize axiomatically the family of extended...

A multiple-partners assignment game with heterogeneous sales and multi-unit demands consists of a set of sellers that own a given number of indivisible units of potentially many different goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...

We study cooperative and competitive solutions for a many- to-many generalization of Shapley and Shubik (1972)s assignment game. We consider the Core, three other notions of group stability and two alternative definitions of competitive equilibrium. We show that (i) each group stable set is...

We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions...

We introduce incomplete information to centralized many-to-one matching markets. This is important because in real life markets (i) any agent is uncertain about the other agents' true preferences and (ii) most entry-level matching is many-to-one (and not one-to-one). We show that given a common...

To allow society to treat unequal alternatives distinctly we propose a natural extension of Approval Voting [7] by relaxing the assumption of neutrality. According to this extension, every alternative receives ex-ante a non-negative and finite weight. These weights may differ across...

In this note we study the National Resident Matching Program (NRMP) algorithm in the US market for physicians. We report on two problems that concern the presence of couples, a feature explicitly incorporated in the new NRMP algorithm (cf. Roth and Peranson, 1999). First, we show that the new...