Showing 1 - 10 of 63
Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable mechanism or the Top Trading Cycles mechanism to assign children to public schools. There is evidence that for school districts that employ (variants of) the so-called Boston mechanism the...
Persistent link: https://www.econbiz.de/10010547129
We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem …
Persistent link: https://www.econbiz.de/10010851337
We observe that three salient solutions to matching, division and house allocation problems are not only (partially …
Persistent link: https://www.econbiz.de/10010851415
A multiple-partners assignment game with heterogeneous sells and multi-unit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...
Persistent link: https://www.econbiz.de/10010851453
The literature on school choice assumes that families can submit a preference list over all the schools they want to be assigned to. However, in many real-life instances families are only allowed to submit a list containing a limited number of schools. Subjects incentives are drastically...
Persistent link: https://www.econbiz.de/10010547189
In this note we study the National Resident Matching Program (NRMP) algorithm in the US market for physicians. We …. Roth and Peranson, 1999). First, we show that the new NRMP algorithm may not find an existing stable matching, even when …
Persistent link: https://www.econbiz.de/10010547404
(partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost …
Persistent link: https://www.econbiz.de/10011115552
. We study in the laboratory the effect of minority reserves on the outcomes of two prominent matching mechanisms, the Gale …
Persistent link: https://www.econbiz.de/10010950612
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
We study cooperative and competitive solutions for a many- to-many generalization of Shapley and Shubik (1972)s assignment game. We consider the Core, three other notions of group stability and two alternative definitions of competitive equilibrium. We show that (i) each group stable set is...
Persistent link: https://www.econbiz.de/10011019700