STABLE MATCHING WITH SPECIAL PREFERENCE PATTERNS

被引：0

作者：

KUO, RT ^{[1
]}

TSENG, SS ^{[1
]}

机构：

[1] NATL CHIAO TUNG UNIV,INST COMP & INFORMAT SCI,HSINCHU 30050,TAIWAN

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1991年 / 38卷 / 3-4期

关键词：

STABLE MATCHING; ASSIGNMENT; PREFERENCE; LATIN SQUARE;

D O I：

10.1080/00207169108803966

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 some special kinds of preference patterns and discuss the elementary properties for stable matching instances with these specific preference patterns. © 1991 Gordon and Breach Science Publishers S.A.

引用

页码：153 / 161

页数：9

共 13 条

[1] Denes J., 1974, LATIN SQUARES THEIR
[2] COLLEGE ADMISSIONS AND STABILITY OF MARRIAGE
GALE, D
SHAPLEY, LS
[J]. AMERICAN MATHEMATICAL MONTHLY, 1962, 69 (01) : 9 - &
[3] 3 FAST ALGORITHMS FOR 4 PROBLEMS IN STABLE MARRIAGE
GUSFIELD, D
[J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (01) : 111 - 128
[4] AN EFFICIENT ALGORITHM FOR THE OPTIMAL STABLE MARRIAGE
IRVING, RW
LEATHER, P
GUSFIELD, D
[J]. JOURNAL OF THE ACM, 1987, 34 (03) : 532 - 543
[5] THE COMPLEXITY OF COUNTING STABLE MARRIAGES
IRVING, RW
LEATHER, P
[J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (03) : 655 - 667
[6] Knuth D., 1976, MARIAGES STABLES
[7] THE NECESSARY AND SUFFICIENT CONDITION FOR THE WORST-CASE MALE OPTIMAL STABLE MATCHING
KUO, RT
TSENG, SS
[J]. INFORMATION PROCESSING LETTERS, 1990, 34 (05) : 261 - 263
[8] Liu C. L., 1968, INTRO COMBINATORIAL
[9] MCVITIE DG, 1971, COMMUN ACM, V14, P491, DOI 10.1145/362619.362632
[10] STABLE MARRIAGE PROBLEM
MCVITIE, DG
WILSON, LB
[J]. COMMUNICATIONS OF THE ACM, 1971, 14 (07) : 486 - &

← 1 2 →