Self-stabilizing distributed stable marriage

Marie Laveau, George Manoussakis, Joffroy Beauquier, Thibault Bernard, Janna Burman, Johanne Cohen, Laurence Pilard

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Stable marriage is a problem of matching in a bipartite graph, introduced in an economic context by Gale and Shapley. In this problem, each node has preferences for matching with its neighbors. The final matching should satisfy these preferences such that in no unmatched pair both nodes prefer to be matched together. The problem has a lot of useful applications (two sided markets, migration of virtual machines in Cloud computing, content delivery on the Internet, etc.). There even exist companies dedicated solely to administering stable matching programs. Numerous algorithms have been designed for solving this problem (and its variants), in different contexts, including distributed ones. However, to the best of our knowledge, none of the distributed solutions is self-stabilizing (self-stabilization is a formal framework that allows dealing with transient corruptions of memory and channels). We present a self-stabilizing stable matching solution, in the model of composite atomicity (state-reading model), under an unfair distributed scheduler. The algorithm is given with a formal proof of correctness and an upper bound on its time complexity in terms of moves and steps.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 19th International Symposium, SSS 2017, Proceedings
EditorsPhilippas Tsigas, Paul Spirakis
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783319690834
StatePublished - 1 Jan 2017
Externally publishedYes
Event19th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2017 - Boston, United States
Duration: 5 Nov 20178 Nov 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10616 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2017
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Self-stabilizing distributed stable marriage'. Together they form a unique fingerprint.

Cite this