An algorithm to compute the full set of many-to-many stable matchings

Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo

Research output: Contribution to journalArticleResearchpeer-review

17 Citations (Scopus)

Abstract

The paper proposes an algorithm to compute the full set of many-to-many stable matchings when agents have substitutable preferences. The algorithm starts by calculating the two optimal stable matchings using the deferred-acceptance algorithm. Then, it computes each remaining stable matching as the firm-optimal stable matching corresponding to a new preference profile, which is obtained after modifying the preferences of a previously identified sequence of firms. © 2003 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)187-210
JournalMathematical Social Sciences
Volume47
DOIs
Publication statusPublished - 1 Mar 2004

Keywords

  • Algorithm
  • Matching
  • Stability
  • Substitutable preferences

Fingerprint Dive into the research topics of 'An algorithm to compute the full set of many-to-many stable matchings'. Together they form a unique fingerprint.

Cite this