Pérez-Castrillo and Wettstein (2002) propose a multi-bidding mechanism to determine a winner from a set of possible projects. The winning project is implemented and its surplus is shared among the agents. In the multi-bidding mechanism each agent announces a vector of bids, one for each...

Controlled choice over public schools is a common policy of school boards in the United States. It attempts giving choice to parents while maintaining racial and ethnic balance at schools. This paper provides a foundation for controlled school choice programs. We develop a natural notion of...

The following properties of the core of a one-to-one matching problem are well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost...

We identify necessary and sufficient conditions for the choice set from every subset A of a (finite) universal set X to coincide with the top cycle in A of some fixed tournament on X.

In practice we often face the problem of assigning indivisible objects (e.g., schools, housing, jobs, offices) to agents (e.g., students, homeless, workers, professors) when monetary compensations are not possible. We show that a rule that satisfies consistency, strategy-proofness, and...

In many economic environments - such as college admissions, student placements at public schools, and university housing allocation - indivisible objects with capacity constraints are assigned to a set of agents when each agent receives at most one object and monetary compensations are not...

This paper extends the theory of endogenous coalition formation, with complete information and transferable utility, to the overlapping case. We propose a cover function bargaining game which allows the formation of overlapping coalitions at equilibrium. We show the existence of subgame perfect...

This paper revisits manipulation via capacities in centralized two-sided matching markets. Sönmez (1997) showed that no stable mechanism is nonmanipulable via capacities. We show that non-manipulability via capacities can be equivalently described by two types of non-manipulation via...