657 research outputs found
Incomplete Information and Small Cores in Matching Markets
We study Bayesian Nash equilibria of stable mechanisms in centralized matching markets under incomplete information. We show that truth-telling is a Bayesian Nash equilibrium of the revelation game induced by a common belief and a stable mechanism if and only if all the profiles in the support of the common belief have singleton cores. Our result matches the observations of Roth and Peranson (1999) in the National Resident Matching Program (NRMP) in the United States: (i) the cores of the profiles submitted to the clearinghouse are small and (ii) while truth-telling is not a dominant strategy most participants of the NRMP truthfully reveal their preferences.Matching Market, Incomplete Information, Small Core
Constrained School Choice
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 transition would lead to efficiency gains. The first two mechanisms are strategy-proof, but in practice student assignment procedures typically impede a student to submit a preference list that contains all his acceptable schools. We study the preference revelation game where students can only declare up to a fixed number of schools to be acceptable. We focus on the stability and efficiency of the Nash equilibrium outcomes. Our main results identify rather stringent necessary and sufficient conditions on the priorities to guarantee stability or efficiency of either of the two mechanisms. This stands in sharp contrast with the Boston mechanism which has been abandoned in many US school districts but nevertheless yields stable Nash equilibrium outcomes.school choice, matching, stability, Gale-Shapley deferred acceptance algorithm, top trading cycles, Boston mechanism, acyclic priority structure, truncation
Robust stability in matching markets
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 is produced by the mechanism. We find that even when school priorities are publicly known and only students can behave strategically, there is a priority structure for which no robustly stable mechanism exists. Our main result shows that there exists a robustly stable mechanism if and only if the priority structure of schools is acyclic (Ergin, 2002), and in that case, the student-optimal stable mechanism is the unique robustly stable mechanism.Matching, stability, strategy-proofness, robust stability, acyclicity
Recommended from our members
Resolving Conflicting Preferences in School Choice
The Boston mechanism is among the most popular school choice procedures in use. Yet, the mechanism has been criticized for its poor incentive and welfare performances, which led the Boston Public Schools to recently replace it with Gale and Shapley's deferred acceptance algorithm (henceforth, DA). The DA elicits truthful revelation of "ordinal" preferences whereas the Boston mechanism does not; but the latter induces participants to reveal their "cardinal" preferences (i.e., their relative preference intensities) whereas the former does not. We show that cardinal preferences matter more when families have similar ordinal preferences and schools have coarse priorities, two common features of many school choice environments. Specifically, when students have the same ordinal preferences and schools have no priorities, the Boston mechanism Pareto dominates the DA in ex ante welfare. The Boston mechanism may not harm but rather benefit participants who may not strategize well. In the presence of school priorities, the Boston mechanism also tends to facilitate a greater access than the DA to good schools by those lacking priorities at those schools. These results contrast with the standard view, and cautions against a hasty rejection of the Boston mechanism in favor of mechanisms such as the DA
Essays on Matching Markets
The thesis "Essays on Matching Markets" contributes to the theory and applications of matching theory. The first chapter analyzes the German university admissions system and proposes an alternative admissions procedure that outperforms the currently used mechanism. In particular, the new mechanism provides strong (i.e. dominant strategy) incentives for applicants to reveal their true preferences and achieves a notion of stability that is adapted to the German system. In the second chapter we analyze the school choice problem with indifferences in priority orders. In this context, stability (with respect to student preferences and school priorities) can be understood as a fairness criterion which ensures that no student ever envies another student for a school at which she has higher priority. Since school seats are objects to be allocated among students, it is important to ensure that a constrained efficient allocation is selected, i.e. an allocation that is stable and not (Pareto-) dominated by any other stable matching. A counterexample of Erdil and Ergin (American Economic Review, 2008) shows that there may not exist a non-manipulable and constrained efficient mechanism. We consider the case where students either all have the same priority or all have distinct priorities for a given school. For this important special case we investigate whether the negative result of Erdil and Ergin is the rule or an exception and derive sufficient conditions for the existence of a constrained efficient and (dominant strategy) incentive compatible mechanism. The proof is constructive and shows how preferences of students can (sometimes) be used to prevent any welfare loss from tie-breaking decisions. The third chapter deals with a more general matching model recently introduced by Ostrovsky (American Economic Review, 2008). For this model we analyze the relation between Ostrovsky's chain stability concept, efficiency, and several competing stability concepts. We characterize the largest class of matching models for which chain stable outcomes are guaranteed to be stable and robust to all possible coalitional deviations. Furthermore, we provide two rationales, one based on efficiency and the other based on robustness considerations, for chain stability in the general supply chain model
Matching with Couples: a Multidisciplinary Survey
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results. Then, we review recent contributions to a complex and representative case of matching with complementarities, namely matching markets with couples. We discuss contributions from computer scientists, economists, and game theorists.matching; couples; stability; computational complexity; incentive compatibility; restricted domains; large markets
Stable Matching Games
Gale and Shapley introduced a matching problem between two sets of agents
where each agent on one side has an exogenous preference ordering over the
agents on the other side. They defined a matching as stable if no unmatched
pair can both improve their utility by forming a new pair. They proved,
algorithmically, the existence of a stable matching. Shapley and Shubik,
Demange and Gale, and many others extended the model by allowing monetary
transfers. We offer a further extension by assuming that matched couples obtain
their payoff endogenously as the outcome of a strategic game they have to play
in a usual non-cooperative sense (without commitment) or in a semi-cooperative
way (with commitment, as the outcome of a bilateral binding contract in which
each player is responsible for his/her part of the contract). Depending on
whether the players can commit or not, we define in each case a solution
concept that combines Gale-Shapley pairwise stability with a (generalized) Nash
equilibrium stability. In each case, we give the necessary and sufficient
conditions for the set of stable allocations to be non-empty, we study its
geometry (full/semi-lattice), and provide an algorithm that converges to its
maximal element. Finally, we prove that our second model (with commitment)
encompasses and refines most of the literature (matching with monetary
transfers as well as matching with contracts)
- âŚ