Fast Distributed Almost Stable Matchings

DOI10.1145/2767386.2767424zbMath1333.68283arXiv1408.2782OpenAlexW1977448627MaRDI QIDQ2796247

Rafail Ostrovsky, Will Rosenbaum

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2782

zbMATH Keywords

approximation algorithmsdistributed algorithmsstable matchingsstable marriage problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (2)

Stable secretaries ⋮ A stable marriage requires communication

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Fast Distributed Almost Stable Matchings