Consider a variation of the Stable Marriage Problem in which a participant only ranks some of the potential partners. Others not ranked are not considered for matching; the person would rather remain single than be matched with those he or she did not rank.
What is an algorithm to maximize the number of matches? Is this the "best" optimality criterion? I'm guessing game theoretic strategic behavior becomes relevant.
No comments :
Post a Comment