Editorial: Special issue on matching under preferences
DOI10.3390/a7020203zbMath1461.00064OpenAlexW2080201224MaRDI QIDQ1736613
No author found.
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a7020203
stable marriage problemstable roommates problemstable matchinghospitals/residents problemoptimal matchingalgorithms and complexitystable flow
Proceedings of conferences of miscellaneous specific interest (00B25) Collections of articles of miscellaneous specific interest (00B15) 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)
Cites Work
- Stable multicommodity flows
- Improving man-optimal stable matchings by minimum change of preference lists
- Maximum locally stable matchings
- Linear time local approximation algorithm for maximum stable marriage
- Stable flows over time
- Local search approaches in stable matching problems
- Stability, optimality and manipulation in matching problems with weighted preferences
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
- On stable matchings and flows
- Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
- Faster and Simpler Approximation of Stable Matchings
This page was built for publication: Editorial: Special issue on matching under preferences
