Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) Original Research Article

The major results known for the marriage and university admissions problems — the one-to-one and many-to-one stable matching problems — are shown to have equivalents in the general many-to-many setting. Some of these results depend upon a particular, natural definition of individual preferences over sets of mates: notably, characterizations of “optimal” stable assignments in terms of “efficiency”, “monotonicity”, and “strategy-proofness”.