Showing 1 - 10 of 121
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
This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...
Persistent link: https://www.econbiz.de/10011684921
We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result...
Persistent link: https://www.econbiz.de/10011673201
We prove that in a market where agents rank objects independently and uniformly at random, there exists an assignment of objects to agents with a constant average rank (i.e., an average rank independent of the market size). The proof builds on techniques from random graph theory and the FKG...
Persistent link: https://www.econbiz.de/10012806604
We introduce a generalization of the school choice problem motivated by the following observations: students are assigned to grades within schools, many students have siblings who are applying as well, and school districts commonly guarantee that siblings will attend the same school. This last...
Persistent link: https://www.econbiz.de/10012806613
In a general model of trading networks with bilateral contracts, we propose a suitably adapted chain stability concept that plays the same role as pairwise stability in two-sided settings. We show that chain stability is equivalent to stability if all agents' preferences are jointly fully...
Persistent link: https://www.econbiz.de/10012415626
We generalize standard school choice models to allow for interdependent preferences and differentially-informed students. We show that in general, the commonly-used deferred acceptance mechanism is no longer strategy-proof, the outcome is not stable, and may make less informed students worse...
Persistent link: https://www.econbiz.de/10012309572
This paper formally examines two competing methods of conducting a lottery in assigning students to schools, motivated by the design of the centralized high school student assignment system in New York City. The main result of the paper is that a single and multiple lottery mechanism are...
Persistent link: https://www.econbiz.de/10011695102
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