Matching under Preferences

Matching theory studies how agents and/or objects from different sets can be matched with each other while taking agents\u2019 preferences into account. The theory originated in 1962 with a celebrated paper by David Gale and Lloyd Shapley (1962), in which they proposed the Stable Marriage Algorithm as a solution to the problem of two-sided matching. Since then, this theory has been successfully applied to many real-world problems such as matching students to universities, doctors to hospitals, kidney transplant patients to donors, and tenants to houses. This chapter will focus on algorithmic as well as strategic issues of matching theory. Many large-scale centralized allocation processes can be modelled by matching problems where agents have preferences over one another. For example, in China, over 10 million students apply for admission to higher education annually through a centralized process. The inputs to the matching scheme include the students\u2019 preferences over universities, and vice versa, and the capacities of each university. The task is to construct a matching that is in some sense optimal with respect to these inputs. Economists have long understood the problems with decentralized matching markets, which can suffer from such undesirable properties as unravelling, congestion and exploding offers (see Roth and Xing, 1994, for details). For centralized markets, constructing allocations by hand for large problem instances is clearly infeasible. Thus centralized mechanisms are required for automating the allocation process. Given the large number of agents typically involved, the computational efficiency of a mechanism's underlying algorithm is of paramount importance. Thus we seek polynomial-time algorithms for the underlying matching problems. Equally important are considerations of strategy: an agent (or a coalition of agents) may manipulate their input to the matching scheme (e.g., by misrepresenting their true preferences or underreporting their capacity) in order to try to improve their outcome. A desirable property of a mechanism is strategyproofness, which ensures that it is in the best interests of an agent to behave truthfully

Acyclicity and singleton cores in matching markets

This paper analyzes the role of acyclicity in singleton cores. We show that the absence of simultaneous cycles is a sufficient condition for the existence of singleton cores. Furthermore, acyclicity in the preferences of either side of the market is a minimal condition that guarantees the existence of singleton cores. If firms or workers preferences are acyclical, unique stable matching is obtained through a procedure that resembles a serial dictatorship. Thus, acyclicity generalizes the notion of common preferences. It follows that if the firms or workers preferences are acyclical, unique stable matching is strongly efficient for the other side of the marketStable matching, Acyclicity, Singleton cores

School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation

In Fall 2009, officials from Chicago Public Schools changed their assignment mechanism for coveted spots at selective college preparatory high schools midstream. After asking about 14,000 applicants to submit their preferences for schools under one mechanism, the district asked them re-submit their preferences under a new mechanism. Officials were concerned that "high-scoring kids were being rejected simply because of the order in which they listed their college prep preferences" under the abandoned mechanism. What is somewhat puzzling is that the new mechanism is also manipulable. This paper introduces a method to compare mechanisms based on their vulnerability to manipulation. Under our notion, the old mechanism is more manipulable than the new Chicago mechanism. Indeed, the old Chicago mechanism is at least as manipulable as any other plausible mechanism. A number of similar transitions between mechanisms took place in England after the widely popular Boston mechanism was ruled illegal in 2007. Our approach provides support for these and other recent policy changes involving matching mechanisms.

The size of the core in school choice

JEL Classification: C78, D82, C71We study the determinants of the size of the core in the school choice problem using three years of data from a large higher education application clearinghouse. The clearinghouse uses a variation of the college-optimal stable mechanism (COSM) to assign applicants to slots in Finnish polytechnics. If the core is large, switching to a student-optimal stable mechanism (SOSM) could yield large improvements for applicants at a cost to schools. We however find that the core is either a singleton or very small each year. This suggests that the student/school trade-off is relatively unimportant within the set of stable matchings in Finnish polytechnic assignments. We show that the similarity of COSM and SOSM matchings is due to correlated school priorities, differing numbers of students and slots, and to students only applying to a small number of programs each. Because these properties are common to other higher education school choice problems, our conclusions are likely to generalize. In spite of the fact that Finnish polytechnics jointly only accept a third of applicants, accepted applicants' average matriculation exam grades are not much better than those of the median applicant. We attribute this to the low effective number of programs applied to, and suggest that details in the design of the application process affect the trade-off in match quality

School Admissions Reform in Chicago and England: Comparing Mechanisms by their Vulnerability to Manipulation

In Fall 2009, officials from Chicago Public Schools abandoned their assignment mechanism for coveted spots at selective college preparatory high schools midstream. After asking about 14,000 applicants to submit their preferences for schools under one mechanism, the district asked them re-submit preferences under a new mechanism. Officials were concerned that \high-scoring kids were being rejected simply because of the order in which they listed their college prep preferences" under the abandoned mechanism. What is somewhat puzzling is that the new mechanism is also manipulable. This paper introduces a method to compare mechanisms based on their vulnerability to manipulation. Under our notion, the old mechanism is more manipulable than the new Chicago mechanism. Indeed, the old Chicago mechanism is at least as manipulable as any other plausible mechanism. A number of similar transitions between mechanisms took place in England after the widely popular Boston mechanism was ruled illegal in 2007. Our approach provides support for these and other recent policy changes involving allocation mechanisms.National Science Foundation (U.S.

Equilibria under deferred acceptance: Dropping strategies, filled positions, and welfare

We study many-to-one matching markets where hospitals have responsive preferences over students. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant strategy of truth-telling

Matching with Couples: Stability and Incentives in Large Markets

Accommodating couples has been a longstanding issue in the design of centralized labor market clearinghouses for doctors and psychologists, because couples view pairs of jobs as complements. A stable matching may not exist when couples are present. We find conditions under which a stable matching exists with high probability in large markets. We present a mechanism that finds a stable matching with high probability, and which makes truth-telling by all participants an approximate equilibrium. We relate these theoretical results to the job market for psychologists, in which stable matchings exist for all years of the data, despite the presence of couples.

Efficiency in Matching Markets with Regional Caps: The Case of the Japan Residency Matching Program

In an attempt to increase the placement of medical residents to rural hospitals, the Japanese government recently introduced "regional caps" which restrict the total number of residents matched within each region of the country. The government modified the deferred acceptance mechanism incorporating the regional caps. This paper shows that the current mechanism may result in avoidable ineffciency and instability and proposes a better mechanism that improves upon it in terms of effciency and stability while meeting the regional caps. More broadly, the paper contributes to the general research agenda of matching and market design to address practical problems.medical residency matching, regional caps, the rural hospital theorem, sta- bility, strategy-proofness, matching with contracts

Fractional solutions for capacitated NTU-games, with applications to stable matchings

Abstract. In this paper we investigate some new applications of Scarf’s Lemma. First, we introduce the notion of fractional core for NTU-games, which is always nonempty by the Lemma. Stable allocation is a general solution concept for games where both the players and their possible cooperations can have capacities. We show that the problem of finding a stable allocation, given a finitely generated NTU-game with capacities, is always solvable by a variant of Scarf’s Lemma. Then we describe the interpretation of these results for matching games. Finally we consider an even more general setting where players ’ contributions in a joint activity may be different. We show that a stable allocation can be found by the Scarf algorithm in this case as well, and we demonstrate the usage of this method for the hospitals resident problem with couples. This problem is relevant in many practical applications, such as NRM