Title: ON THE INVARIANCE OF MALE OPTIMAL STABLE MATCHING
Authors: KUO, RT
TSENG, SS
資訊科學與工程研究所
Institute of Computer Science and Engineering
Keywords: STABLE MATCHING PROBLEM;ASSIGNMENT;PREFERENCE;INVARIANCE
Issue Date: 1990
Abstract: The stable matching problem is that of matching two sets of agents in such a manner that no two unmatched agents prefer each other to their actual partners under the matching. In this paper, we present a set of sufficient conditions on the preference lists of any given stable matching instance, under which the optimality of the original male optimal stable matching is still preserved.
URI: http://hdl.handle.net/11536/4209
http://dx.doi.org/10.1007/BF01933208
ISSN: 0006-3835
DOI: 10.1007/BF01933208
Journal: BIT
Volume: 30
Issue: 4
Begin Page: 592
End Page: 598
Appears in Collections:Articles


Files in This Item:

  1. A1990EX83000003.pdf