Access Restriction

Author McVitie, D. G. ♦ Wilson, L. B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Assignment procedures ♦ Discrete mathematics ♦ Operational research ♦ Combinatorics ♦ Stable marriage problem ♦ Assignment problems ♦ University entrance
Abstract The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all the stable marriage assignments. The algorithm derived for finding all the stable marriage assignments is proved to satisfy all the conditions of the problem. Algorithm 411 applies to this paper.
Description Affiliation: Univ. of Newcastle upon Tyne, England (Wilson, L. B.) || Software Science, Ltd., Wilmslow, Cheshire, England (McVitie, D. G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 14
Issue Number 7
Page Count 5
Starting Page 486
Ending Page 490

Open content in new tab

   Open content in new tab
Source: ACM Digital Library