出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：We consider a variant of socially stable marriage problem where preference lists may beincomplete, may contain ties and may have bounded length. In real world application likeNRMP and Scottish medical matching scheme such restrictions arise very frequently where setof agents (man/woman) is very large and providing a complete and strict order preference list ispractically in-feasible. In presence of ties in preference lists, the most common solution isweakly socially stable matching. It is a fact that in an instance, weakly stable matching can havedifferent sizes. This motivates the problem of finding a maximum cardinality weakly sociallystable matching.In this paper, we find maximum size weakly socially stable matching for an instance of StableMarriage problem with Ties and Incomplete bounded length preference list with SocialStability. The motivation to consider this instance is the known fact, any larger instance of thisproblem is NP-hard.
关键词：Stable Marriage Problem; Socially Stable Matching; Bipartite Matching; Stable Marriage;Problem with Ties and Incomplete list.
