Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 101 (Stable Marriages Problem) — Constraint detection

In the Stable Marriage problem , we have n men and n women . Each man ranks the n women into a preference list . So also do the women . The problem is then to produce a matching of men to women such that it is stable . By a matching we mean that there is a bijection from men to women , and by stable we mean that there is no incentive for partners to divorce and elope . A matching is unstable if there are two couples -LRB- mi , wj -RRB- and -LRB- mk , wl -RRB- such that mi prefers wl to his current partner wj , and wl prefers mi to her current partner mk . Stable matching problems occur naturally while matching people to posts , such as the allocation of residents to hospitals in the US , Canada , and Scotland .

Problem 101 (Stable Marriages Problem) — Detection of the decisions and objects to be modeled

In the Stable Marriage problem , we have n men and n women . Each man ranks the n women into a preference list . So also do the women . The problem is then to produce a matching of men to women such that it is stable . By a matching we mean that there is a bijection from men to women , and by stable we mean that there is no incentive for partners to divorce and elope . A matching is unstable if there are two couples -LRB- mi , wj -RRB- and -LRB- mk , wl -RRB- such that mi prefers wl to his current partner wj , and wl prefers mi to her current partner mk . Stable matching problems occur naturally while matching people to posts , such as the allocation of residents to hospitals in the US , Canada , and Scotland .

Back to list