caa a22 4500 465821286 CHVBK 20180323112136.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF01933208 doi (NATIONALLICENCE)springer-10.1007/BF01933208 On the invariance of male optimal stable matching [Elektronische Daten] [R. Kuo, S. Tseng] 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. BIT Foundations, 1990 F.2.0 nationallicence G.2.1 nationallicence Stable matching problem nationallicence assignment nationallicence preference nationallicence invariance nationallicence Kuo R. Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan 30050, Republic of China aut Tseng S. Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan 30050, Republic of China aut BIT Numerical Mathematics Kluwer Academic Publishers 30/4(1990-12-01), 592-598 0006-3835 30:4<592 1990 30 10543 https://doi.org/10.1007/BF01933208 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF01933208 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Kuo R. Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan 30050, Republic of China aut NATIONALLICENCE 700 1- Tseng S. Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan 30050, Republic of China aut NATIONALLICENCE 773 0- BIT Numerical Mathematics Kluwer Academic Publishers 30/4(1990-12-01), 592-598 0006-3835 30:4<592 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer