Editorial: Special issue on matching under preferences

DOI10.3390/A7020203zbMATH Open1461.00064OpenAlexW2080201224MaRDI QIDQ1736613FDOQ1736613

Authors

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3390/a7020203

zbMATH Keywords

hospitals/residents problemstable marriage problemstable matchingoptimal matchingstable roommates problemalgorithms and complexitystable flow

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Matching models (91B68)

Recommendations

• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Stable matching with special preference patterns
• Three-sided matching problem with mixed preferences
• Matching under preferences
• Matching with preferences over colleagues solves classical matching

Cites work

• Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
• Faster and simpler approximation of stable matchings
• Improving man-optimal stable matchings by minimum change of preference lists
• Linear time local approximation algorithm for maximum stable marriage
• Local search approaches in stable matching problems
• Maximum locally stable matchings
• On stable matchings and flows
• Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
• Stability, optimality and manipulation in matching problems with weighted preferences
• Stable flows over time
• Stable multicommodity flows

Cited in

(3)

• Selected open problems in matching under preferences
• Preface
• Special issue: Selected papers based on the presentations at the workshop ``Match-UP: Matching under preferences -- algorithms and complexity, Reykjavík, Iceand, July 2008

This page was built for publication: Editorial: Special issue on matching under preferences

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