Capacitated Rank-Maximal Matchings
From MaRDI portal
Publication:4924662
DOI10.1007/978-3-642-38233-8_27zbMath1382.91057OpenAlexW173284602MaRDI QIDQ4924662
Publication date: 7 June 2013
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-38233-8_27
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Matching models (91B68)
Related Items (5)
Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms ⋮ Fair matchings and related problems ⋮ Dynamic rank-maximal and popular matchings ⋮ The dynamics of rank-maximal and popular matchings ⋮ Rank-maximal matchings -- structure and algorithms
This page was built for publication: Capacitated Rank-Maximal Matchings
