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 consider collective choice problems where a set of agents have to choose an alternative from a finite set and agents may or may not become users of the chosen alternative. An allocation is a pair given by the chosen alternative and the set of its users. Agents have gregarious preferences over...

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 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 study efficiency and fairness properties of the equal cost sharing with maximal participation (ECSMP) mechanism in the provision of a binary and excludable public good. According to the maximal welfare loss criterion, the ECSMP is optimal within the class of strategyproof, individually...

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 consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters' preferences are separable or additively representable.

We study the effciency and fairness properties of the equal cost sharing mechanism in the provision of a binary and excludable public good. According to the maximal welfare loss criterion, equal cost sharing is optimal within the class of strategyproof, individually rational and no-budgetde…cit...