Distributed Weighted Stable Marriage Problem

DOI10.1007/978-3-642-13284-1_4MaRDI QIDQ3569114zbMATH OpenOpenAlexFDO

Authors Nir Amira, R. Giladi, Zvi Lotker

Publication date 17 June 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

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

zbMATH Keywords

billboarddistributed algorithmsmatchingschedulingstable marriage

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15) Matching models (91B68)

Recommendations

• Distributed Stable Matching Problems
• Self-stabilizing distributed stable marriage
• scientific article; zbMATH DE number 45086
• A parallel algorithm to solve the stable marriage problem
• scientific article; zbMATH DE number 4062556
• Efficiency and stability of probabilistic assignments in marriage problems
• Randomized approximation of the stable marriage problem
• Randomized approximation of the stable marriage problem
• A note on weighted distributed match-making

Cited in

(7)

• Almost stable matchings by truncating the Gale-Shapley algorithm
• Distributed stable matching with similar preference lists
• Distributed Stable Matching Problems
• Communication requirements for stable marriages
• Self-stabilizing distributed stable marriage
• Distributed near-optimal matching
• On the complexity of distributed stable matching with small messages

This page was built for publication: Distributed Weighted Stable Marriage Problem

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