This paper considers a house allocation problem with no initial ownership and where prices are bounded from below and above by exogenously given price restrictions. This type of housing market contains, e.g., the "assignment market" and the "student placement problem" as special cases. A...

We observe that three salient solutions to matching, division and house allocation problems are not only (partially) strategy-proof, but (partially) group strategy-proof as well, in appropriate domains of definition. That is the case for the Gale-Shapley mechanism, the uniform rule and the top...

We observe that many salient rules to allocate private goods are not only (partially) strategy-proof, but also (partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost sharing, house allocation and auctions, in spite of the...

We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result...

We consider the problem of matching a set of medical students to a set of medical residency positions (hospitals) under the assumption that hospitals' preferences over groups of students are responsive. In this context, we study the preference revelation game induced by the student proposing...

This paper develops a framework for studying repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers) in every period. I define history-dependent and...

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

Agents with reciprocal preferences prefer to be matched to a partner who also likes to collaborate with them. In this paper, we introduce and formalize reciprocal preferences, apply them to matching markets, and analyze the implications for mechanism design. Formally, the preferences of an agent...

We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in...

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