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.
|Journal||Mathematical Social Sciences|
|Publication status||Published - 1 Mar 2004|
- Substitutable preferences