Matching Markets under (In)complete Information

L. Ehlers acknowledges financial support from the SSHRC (Canada) and the FQRSC (Québec). Support for the research of J. Massó was received through the prize "ICREA Acadèmia" for excellence in research, funded by the Generalitat de Catalunya. He also acknowledges the support of MOVE (where he is an affiliated researcher) and the Government of Catalonia, through grants SGR 2009-419 and 2014-515. His work is also supported by the Spanish Ministry of Economy and Competitiveness, through the Severo Ochoa Programme for Centers of Excellence in R&D (SEV-2011-0075) and FEDER grant ECO2008-04756 (Grupo Consolidado C). Part of this research was done while J. Massó was visiting the Université de Montréal and while L. Ehlers was visiting the Universitat Autònoma de Barcelona; the visits were financed by CIREQ and CREA, respectively.We introduce incomplete information to centralized many-to-one matching markets. This is important because in real life markets (i) any agent is uncertain about the other agents' true preferences and (ii) most entry-level matching is many-to-one (and not one-to-one). We show that given a common prior, a strategy profile is an ordinal Bayesian Nash equilibrium under incomplete information in a stable mechanism if and only if, for any true profile in the support of the common prior, the submitted profile is a Nash equilibrium under complete information in the direct preference revelation game induced by the stable mechanism

Constrained School Choice: An Experimental Study

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 affected, as more individuals manipulate their preferences. Including a safety school in the constrained list explains most manipulations. Competitiveness across schools play an important role. Constraining choices increases segregation and affects the stability and efficiency of the final allocation. Remarkably, the constraint reduces significantly the proportion of subjects playing a dominated strategy.school choice, matching, experiment

Constrained School Choice: An Experimental Study

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 affected, as more individuals manipulate their preferentes. Including a safety school in the constrained list explains most manipulations. Competitiveness across schools plays an important role. Constraining choices increases segregation and affects the stability and efficiency of the final allocation. Remarkably, the constraint reduces significantly the proportion of subjects playing a dominated strategy.School Choice, Matching, Experiment, Gale-Shapley, Top Trading Cycles, Boston Mechanism, Efficiency, Stability, Truncation, Truthtelling, Safety School

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 design in monotonic matching markets : a case for firm-proposing deferred-acceptance

We study two-sided matching markets among workers and firms. Workers seek one position at a firm but firms may employ several workers. In many applications those markets are monotonic: leaving positions unfilled is costly as for instance, for hospitals this means not being able to provide full service to its patients. A huge literature has advocated the use of stable mechanisms for clearinghouses. The interests among workers and firms are polarized among stable mechanisms, most famously the firm-proposing DA and the worker-proposing DA. We show that for the firm-proposing DA ex-ante incentive compatibility and ex-post incentive compatibility are equivalent whereas this is not necessarily true for the worker-proposing DA. The firm-proposing DA turns out to be more robust than the worker-proposing DA under incomplete information when incentives of both sides of the market are important

Constrained school choice : an experimental study

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 affected, as more individuals manipulate their preferences. Including a safety school in the constrained list explains most manipulations. Competitiveness across schools play an important role. Constraining choices increases segregation and affects the stability and efficiency of the final allocation. Remarkably, the constraint reduces significantly the proportion of subjects playing a dominated strategy

Incontestable Assignments

In school districts where assignments are exclusively determined by a clearinghouse students can only appeal their assignment with a valid reason. An assignment is incontestable if it is appeal-proof. We study incontestability when students do not observe the other students' preferences and assignments. Incontestability is shown to be equivalent to individual rationality, non-wastefulness, and respect for top-priority sets (a weakening of justified envy). Stable mechanisms and those Pareto dominating them are incontestable, as well as the Top-Trading Cycle mechanism (but Boston is not). Under a mild consistency property, incontestable mechanisms are i-indinstiguishable (Li, 2017), and share similar incentive properties