Editorial: Special issue on matching under preferences
From MaRDI portal
Publication:1736613
hospitals/residents problemstable marriage problemstable matchingoptimal matchingstable roommates problemalgorithms and complexitystable flow
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
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)
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)