Stability and Strategy-Proofness for Matching with Constraints: A Problem in the Japanese Medical Match and Its Solution

2012 ◽  
Vol 102 (3) ◽  
pp. 366-370 ◽  
Author(s):  
Yuichiro Kamada ◽  
Fuhito Kojima

Real matching markets are subject to constraints. For example, the Japanese government introduced a new medical matching system in 2009 that imposes a “regional cap” in each of its 47 prefectures, which regulates the total number of medical residents who can be employed in each region. Based on Kamada and Kojima (2011), this paper studies matching markets with such constraints by examining in great detail the Japanese medical matching market. Specifically, we show that the new system introduced in 2009 has problems in terms of stability and strategy-proofness, and provide an alternative mechanism that does better.

2019 ◽  
Vol 44 (3) ◽  
pp. 160-169 ◽  
Author(s):  
Andrea Gayle Sharam

A key area of system impact of the fourth industrial revolution (4IR) is the radical improvement in the functioning of matching markets. Matching markets are markets in which agents seek to be paired with someone or something with the criteria for matching often highly specific. Traditionally, the cost and difficulty in matching means many of these markets have not functioned well. Uber and Airbnb are examples of new matching market matchmakers that have been ‘turbo-charged’ by new digital technologies, resulting in what Parker et al. describe as a ‘platform revolution’. In this article, we examine the traditional, but poorly functioning, matching market for new multifamily housing development in Melbourne, Australia, and the potential for disruption offered by a new platform, Nightingale Housing Ltd. (NHL). Improved matching has been critical to the model and the Internet has been central to this. The NHL model has the potential for systems impact as outlined by Schwab in his conception of 4IR.


Author(s):  
Antonio Romero-Medina ◽  
Matteo Triossi

Abstract We study the existence of group strategy-proof stable rules in many-to-many matching markets under responsiveness of agents’ preferences. We show that when firms have acyclical preferences over workers the set of stable matchings is a singleton, and the worker-optimal stable mechanism is a stable and group strategy-proof rule for firms and workers. Furthermore, acyclicity is the minimal condition guaranteeing the existence of stable and strategy-proof mechanisms in many-to-many matching markets.


1999 ◽  
Vol 89 (4) ◽  
pp. 748-780 ◽  
Author(s):  
Alvin E Roth ◽  
Elliott Peranson

We report on the design of the new clearinghouse adopted by the National Resident Matching Program, which annually fills approximately 20,000 jobs for new physicians. Because the market has complementarities between applicants and between positions, the theory of simple matching markets does not apply directly. However, computational experiments show the theory provides good approximations. Furthermore, the set of stable matchings, and the opportunities for strategic manipulation, are surprisingly small. A new kind of “core convergence” result explains this; that each applicant interviews only a small fraction of available positions is important. We also describe engineering aspects of the design process. (JEL C78, B41, J44)


2011 ◽  
Vol 9 (7) ◽  
pp. 20-21
Author(s):  
BRUCE JANCIN
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document