Please use this identifier to cite or link to this item:
Title: Gale-Shapley stable marriage problem revisited: Strategic issues and applications
Authors: Teo, C.-P. 
Sethuraman, J.
Tan, W.-P.
Keywords: Gale-Shapley Algorithm
Stable Marriage
Strategic Issues
Student Posting Exercise
Issue Date: 2001
Citation: Teo, C.-P.,Sethuraman, J.,Tan, W.-P. (2001). Gale-Shapley stable marriage problem revisited: Strategic issues and applications. Management Science 47 (9) : 1252-1267. ScholarBank@NUS Repository.
Abstract: We study strategic issues in the Gale-Shapley stable marriage model. In the first part of the paper, we derive the optimal cheating strategy and show that it is not always possible for a woman to recover her women-optimal stable partner from the men-optimal stable matching mechanism when she can only cheat by permuting her preferences. In fact, we show, using simulation, that the chances that a woman can benefit from cheating are slim. In the second part of the paper, we consider a two-sided matching market found in Singapore. We study the matching mechanism used by the Ministry of Education (MOE) in the placement of primary six students in secondary schools, and discuss why the current method has limited success in accommodating the preferences of the students, and the specific needs of the schools (in terms of the "mix" of admitted students). Using insights from the first part of the paper, we show that stable matching mechanisms are more appropriate in this matching market and explain why the strategic behavior of the students need not be a major concern.
Source Title: Management Science
ISSN: 00251909
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Sep 9, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.