Showing 1 - 10 of 27,902
We run laboratory experiments where subjects are matched to colleges, and colleges are not strategic agents. We test … the Gale-Shapley Deferred Acceptance (DA) mechanism versus the Iterative Deferred Acceptance Mechanism (IDAM), a matching … robustness of stability between the rounds of experiments. Our findings provide substantial support for the rising practice of …
Persistent link: https://www.econbiz.de/10011574107
We run laboratory experiments where subjects are matched to colleges, and colleges are not strategic agents. We test … the Gale-Shapley Deferred Acceptance (DA) mechanism versus the Iterative Deferred Acceptance Mechanism (IDAM), a matching … robustness of stability between the rounds of experiments. Our findings provide substantial support for the rising practice of …
Persistent link: https://www.econbiz.de/10011574203
observed outcomes are stable, and among those a large majority culminate at the receiver-optimal stable matching. Second …
Persistent link: https://www.econbiz.de/10011800605
unraveling can only occur when firms are willing to make early offers and workers are willing to accept them. We present a model …, matching can occur (inefficiently) early only when there is comparable demand and supply: a surplus of applicants, but a …
Persistent link: https://www.econbiz.de/10009785461
I provide a brief introduction to the early literatures on Matching, Auctions, and Market Design.The design of matching …
Persistent link: https://www.econbiz.de/10013082184
We propose a notion of core for school choice problems. We say that a coalition of students is able to enforce a subassignment among them if, given their priorities at schools, other students together cannot exclude any of them from her assignment. An assignment is in the core if no coalition of...
Persistent link: https://www.econbiz.de/10012838118
In many centralized matching markets, agents' property rights over objects are derived from a coarse transformation of … stable matching mechanisms, the optimal design can be attained by splitting agents into at most three indifference classes …
Persistent link: https://www.econbiz.de/10012849357
Gale-Shapley deferred acceptance algorithm for dynamic problems and show that it yields a matching that satisfies strong … stability. It is not Pareto dominated by any other matching, and, if there is an efficient stable matching, it must be the Gale … stronger impossibility result: For the class of dynamic matching problems that we study, there are no algorithms that satisfy …
Persistent link: https://www.econbiz.de/10009024462
Persistent link: https://www.econbiz.de/10011943725
design of the matching procedure can prevent unraveling. … changes to the network structure on the unraveling of the market towards early hiring. Moreover, we show that an efficient …
Persistent link: https://www.econbiz.de/10010284029