Using the assignment of students to schools as our leading example, we study many-to-one two-sided matching markets without transfers. Students are endowed with cardinal preferences and schools with ordinal ones, while preferences of both sides need not be strict. Using the idea of a competitive...

We propose a model based on competitive markets in order to analyse an economy with several homogeneous landlords and heterogeneous tenants. We model the landlord- tenant economy as a two-sided matching game and characterise the equilibrium of this market. In equilibrium, contracts are Pareto...

We experimentally investigate in the laboratory two prominent mechanisms that are employed in school choice programs to assign students to public schools. We study how individual behavior is influenced by preference intensities and risk aversion. Our main results show that (a) the GaleShapley...

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 correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange,...

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

This paper studies a decentralized job market model where firms (academic departments) propose sequentially a (unique) position to some workers (Ph.D. candidates). Successful candidates then decide whether to accept the offers, and departments whose positions remain unfllled propose to other...

We show that the full version of the so-called "rural hospital theorem" generalizes to many-to-many matching problems where agents on both sides of the problem have substitutable and weakly separable preferences. We reinforce our result by showing that when agents' preferences satisfy...

We give a simple and concise proof that so-called generalized median stable matchings are well-defined for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the...