Communication requirements for stable marriages

DOI10.1007/978-3-642-13073-1_33zbMATH Open1284.05210OpenAlexW1535224738MaRDI QIDQ3563017FDOQ3563017

Authors Jen-Hou Chou, Chi-Jen Lu 

Publication date 28 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13073-1_33

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15) Matching models (91B68)

Recommendations

• A Stable Marriage Requires Communication
• A stable marriage requires communication
• On the complexity of distributed stable matching with small messages
• Distributed Weighted Stable Marriage Problem
• Fast distributed almost stable matchings

Cited in

(3)

• A stable marriage requires communication
• A Stable Marriage Requires Communication
• On the complexity of distributed stable matching with small messages

This page was built for publication: Communication requirements for stable marriages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563017)