The rational-choice framework for modeling matching markets has been tremendously useful in guiding the design of school-assignment systems. Despite this success, a large body of work documents deviations from the predictions of this framework that appear influenced by behavioral-economic...

We study a many-to-one matching problem between institutions and individuals where an institution can possibly be matched to more than one individual. The matching market contains some couples who view pairs of jobs as complements. Institutions' preferences over sets of individuals are assumed...

We propose a solution to the trade-off between Pareto efficiency and stability in matching markets. We define a matching to be essentially stable if any claim initiates a chain of reassignments that ultimately results in the initial claimant losing the object she claimed to a third agent. Our...

I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available...

In 56 developing and developed countries, blood component donations by volunteer non-remunerated donors can only meet less than 50% of the demand. In these countries, blood banks rely heavily on replacement donor programs that provide blood to patients in return for donations made by their close...

I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available...

Goods and services---public housing, medical appointments, schools---are often allocated to individuals who rank them similarly but differ in their preference intensities. We characterize optimal allocation rules when individual preferences are known and when they are not. Several insights...

Evidence suggests that participants in direct student-proposing deferred-acceptance mechanisms (DA) play dominated strategies. To explain the data, we introduce expectation-based loss aversion into a school-choice setting and characterize choice-acclimating personal equilibria in DA. We find...

For object reallocation problems, if preferences are strict but otherwise unrestricted, the Top Trading Cycle rule (TTC) is the leading rule: It is the only rule satisfying efficiency, the endowment lower bound, and strategy-proofness; moreover, TTC coincides with the core. However, on the...

We extend the preference domain of the assignment problem to accommodate ordinal, cardinal and mixed preferences together and thereby allow the mechanism designer to elicit different levels of information about individuals' preferences. Given a fixed preference relation over a finite set of...