Munich Personal RePEc Archive

Matchings under Stability, Minimum Regret, and Forced and Forbidden Pairs in Marriage Problem

Mandal, Pinaki and Roy, Souvik (2021): Matchings under Stability, Minimum Regret, and Forced and Forbidden Pairs in Marriage Problem.

[img]
Preview
PDF
MPRA_paper_107213.pdf

Download (318kB) | Preview

Abstract

We provide a class of algorithms, called men-women proposing deferred acceptance (MWPDA) algorithms, that can produce all stable matchings at every preference profile for the marriage problem. Next, we provide an algorithm that produces a minimum regret stable matching at every preference profile. We also show that its outcome is always women-optimal in the set of all minimum regret stable matchings. Finally, we provide an algorithm that produces a stable matching with given sets of forced and forbidden pairs at every preference profile, whenever such a matching exists. As before, here too we show that the outcome of the said algorithm is women-optimal in the set of all stable matchings with given sets of forced and forbidden pairs.

Logo of the University Library LMU Munich
MPRA is a RePEc service hosted by
the University Library LMU Munich in Germany.