Popularity in the generalized hospital residents setting
From MaRDI portal
Publication:2399378
DOI10.1007/978-3-319-58747-9_22zbMath1489.68200arXiv1609.07650OpenAlexW2526872272WikidataQ62045764 ScholiaQ62045764MaRDI QIDQ2399378
Publication date: 22 August 2017
Full work available at URL: https://arxiv.org/abs/1609.07650
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Matching models (91B68)
Related Items (9)
Popularity in the generalized hospital residents setting ⋮ Two problems in max-size popular matchings ⋮ Popular critical matchings in the many-to-many setting ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Unnamed Item ⋮ Popular Matchings with Lower Quotas ⋮ How Good Are Popular Matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Two algorithms for the student-project allocation problem
- Size versus stability in the marriage problem
- Popular edges and dominant matchings
- Popularity in the generalized hospital residents setting
- A Matroid Approach to Stable Matchings with Lower Quotas
- Popular Matchings in the Stable Marriage Problem
- Popular Matchings
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- College Admissions and the Stability of Marriage
This page was built for publication: Popularity in the generalized hospital residents setting