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

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

doi:10.1016/j.mathsocsci.2003.07.002

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 journal › Article › Research › peer-review

30 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 language	English
Pages (from-to)	187-210
Journal	Mathematical Social Sciences
Volume	47
DOIs	https://doi.org/10.1016/j.mathsocsci.2003.07.002
Publication status	Published - 1 Mar 2004

Keywords

Algorithm
Matching
Stability
Substitutable preferences

Access to Document

10.1016/j.mathsocsci.2003.07.002

https://ddd.uab.cat/record/143679

Cite this

@article{c39504ceea8d499684323f40e98d55c2,

title = "An algorithm to compute the full set of many-to-many stable matchings",

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. {\textcopyright} 2003 Elsevier B.V. All rights reserved.",

keywords = "Algorithm, Matching, Stability, Substitutable preferences",

author = "Ruth Mart{\'i}nez and Jordi Mass{\'o} and Alejandro Neme and Jorge Oviedo",

year = "2004",

month = mar,

day = "1",

doi = "10.1016/j.mathsocsci.2003.07.002",

language = "English",

volume = "47",

pages = "187--210",

}

TY - JOUR

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

AU - Martínez, Ruth

AU - Massó, Jordi

AU - Neme, Alejandro

AU - Oviedo, Jorge

PY - 2004/3/1

Y1 - 2004/3/1

N2 - 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.

AB - 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.

KW - Algorithm

KW - Matching

KW - Stability

KW - Substitutable preferences

U2 - 10.1016/j.mathsocsci.2003.07.002

DO - 10.1016/j.mathsocsci.2003.07.002

M3 - Article

SN - 0165-4896

VL - 47

SP - 187

EP - 210

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this