Showing 1 - 10 of 45
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.
Persistent link: https://www.econbiz.de/10010851319
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,...
Persistent link: https://www.econbiz.de/10010851337
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...
Persistent link: https://www.econbiz.de/10010851345
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...
Persistent link: https://www.econbiz.de/10010851361
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...
Persistent link: https://www.econbiz.de/10010851385
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...
Persistent link: https://www.econbiz.de/10010851401
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...
Persistent link: https://www.econbiz.de/10010851408
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...
Persistent link: https://www.econbiz.de/10010851415
We identify in this paper two conditions that characterize the domain of single-peaked preferences on the line in the following sense: a preference profile satisfies these two properties if and only if there exists a linear order L over the set of alternatives such that these preferences are...
Persistent link: https://www.econbiz.de/10010851422
For each assignment market, an associated bargaining problem is defined and some bargaining solutions to this problem are analyzed. For a particular choice of the disagreement point, the Nash solution and the Kalai-Smorodinsky solution coincide and give the midpoint between the buyers-optimal...
Persistent link: https://www.econbiz.de/10010851444