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

We study Bayesian Nash equilibria of stable mechanisms in centralized matching markets under incomplete information. We show that truth-telling is a Bayesian Nash equilibrium of the revelation game induced by a common belief and a stable mechanism if and only if all the profiles in the support...

We are the first to introduce incomplete information to centralized many-to-one matching markets such as those to entry-level labor markets or college admissions. This is important because in real life markets (i) any agent is uncertain about the other agents' true preferences and (ii) most...

We are the first to introduce incomplete information to centralized many-to-one matching markets such as those to entry-level labor markets or college admissions. This is important because in real life markets (i) any agent is uncertain about the other agents' true preferences and (ii) most...

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

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 consider a set of agents who have to choose one alternative among a finite set of social alternatives. A final allocation is a pair given by the selected alternative and the group of its users. Agents have crowding preferences over allocations: between any pair of allocations with the same...

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