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

The theoretical literature on the cumulative innovation process has emphasized the role of ex-ante licensing – namely, licensing agreements negotiated before the follow-on innovator has sunk its R&D investment – in mitigating the risk of hold-up of future innovations. In this paper, we...

We consider the classic cake-division problem when the cake is a heterogeneous good represented by an interval in the real line. We provide a mechanism to implement, in an anonymous way, an envy-free and efficient allocation when agents have private information on their preferences. The...

We consider the general many-to-one matching model with ordinal preferences and give a procedure to partition the set of preference profiles into subsets with the property that all preference profiles in the same subset have the same Core. We also show how to identify a profile of (incomplete)...

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 characterize the class of strategy-proof social choice functions on the domain of symmetric single-peaked preferences. This class is strictly larger than the set of generalized median voter schemes (the class of strategy-proof and tops-only social choice functions on the domain of...