Showing 1 - 10 of 1,233
In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy …-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that …
Persistent link: https://www.econbiz.de/10011599445
In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy …-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that …
Persistent link: https://www.econbiz.de/10011694986
notions of fairness in lottery design based on ex-ante stability. This framework unifies known many-to-one and one …-sided matching models. We show that the NYC/Boston mechanism fails to satisfy these fairness properties. We then propose two new … ex-ante stability, equal treatment, and constrained ordinal-Pareto-efficiency. …
Persistent link: https://www.econbiz.de/10011599548
notions of fairness in lottery design based on ex-ante stability. This framework unifies known many-to-one and one …-sided matching models. We show that the NYC/Boston mechanism fails to satisfy these fairness properties. We then propose two new … ex-ante stability, equal treatment, and constrained ordinal-Pareto-efficiency. …
Persistent link: https://www.econbiz.de/10011673364
notions of fairness in lottery design based on ex-ante stability. This framework unifies known many-to-one and one …-sided matching models. We show that the NYC/Boston mechanism fails to satisfy these fairness properties. We then propose two new … ex-ante stability, equal treatment, and constrained ordinal-Pareto-efficiency. …
Persistent link: https://www.econbiz.de/10011019208
For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of … college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking …
Persistent link: https://www.econbiz.de/10005247863
Gale and Shapley (1962) proposed the deferred-acceptance algorithm for matching (i) college applicants and colleges and … always Pareto-optimal: No other matching is at least as good for all the players and better for one or more. If there are …
Persistent link: https://www.econbiz.de/10011109567
We consider the problem of matching a set of medical students to a set of medical residency positions (hospitals) under … preference revelation game induced by the student proposing deferred acceptance mechanism. We show that the acyclicity of the …
Persistent link: https://www.econbiz.de/10011817201
We introduce a two-sided, many-to-one matching with contracts model in which agents with unit demand match to branches … matching markets with slot-specific priorities, branches' choice functions may not satisfy the substitutability conditions … typically crucial for matching with contracts. Despite this complication, we are able to show that stable outcomes exist in the …
Persistent link: https://www.econbiz.de/10011671965
-proof mechanism that is constrained efficient, i.e. that always produces a stable matching that is not Pareto-dominated by another … stable matching. We characterize all solvable priority structures satisfying the following two restrictions: (A) Either there …
Persistent link: https://www.econbiz.de/10011937252