Game Theoretic Consequences of Resident Matching
The resident matching algorithm, Gale-Shapley, currently used by SF Match and the National Residency Match Program (NRMP), has been in use for over 50 years without fundamental alteration. The algorithm is a 'stable-marriage' method that favors applicant outcomes. However, in these 50 years, there has been a big shift in the supply and demand of applicants and programs. These changes along with the way the Match is implemented have induced a costly race among applicants to apply and interview at as many programs as possible. Meanwhile programs also incur high costs as they maximize their probability of matching by interviewing as many candidates as possible.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The matching problem with linear transfers is equivalent to a hide-and-seek game
Matching problems with linearly transferable utility (LTU) generalize the well-studied transferable utility (TU) case by relaxing the assumption that utility is transferred one-for-one within matched pairs. We show that …
Occam's Razor in Residential PV-Battery Systems: Theoretical Interpretation, Practical Implications, and Possible Improvements
This paper presents a theoretical interpretation and explores possible improvements of a widely adopted rule-based control for residential solar photovoltaics (PV) paired with battery storage systems (BSS). The method is…
Non Cooperative Game Theoretic Approach for Residential Energy Management in Smart Grid
Demand side management (DSM) is one of the main functionalities of the smart grid as it allows the consumer to adjust its energy consumption for an efficient energy management. Most of the existing DSM techniques aim at …
energy managementManagementSchedulingExploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples
The Stable Matching Problem with Couples (SMP-C) is a ubiquitous real-world extension of the stable matching problem (SMP) involving complementarities. Although SMP can be solved in polynomial time, SMP-C is NP-Complete.…
In-game Residential Home Planning via Visual Context-aware Global Relation Learning
In this paper, we propose an effective global relation learning algorithm to recommend an appropriate location of a building unit for in-game customization of residential home complex. Given a construction layout, we pro…
Graph GenerationRelation