Popular matchings with multiple partners
From MaRDI portal
Publication:5136309
DOI10.4230/LIPICS.FSTTCS.2017.19zbMATH Open1491.68140arXiv1609.07531MaRDI QIDQ5136309FDOQ5136309
Authors: Florian Brandl, Telikepalli Kavitha
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1609.07531
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Matching models (91B68)
Cites Work
- Some remarks on the stable matching problem
- The hospitals/residents problem with lower quotas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classified stable matching
- College Admissions and the Stability of Marriage
- Stability and Polarization of Interests in Job Matching
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Three remarks on the many-to-many stable matching problem
- Popular matchings in the marriage and roommates problems
- Popular Matchings
- Title not available (Why is that?)
- Popular mixed matchings
- Socially stable matchings in the hospitals/residents problem
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Popularity, mixed matchings, and self-duality
- Popular Half-Integral Matchings.
- Popularity in the generalized hospital residents setting
Cited In (8)
- Minimal envy and popular matchings
- Solving the maximum popular matching problem with matroid constraints
- Popular matchings of desired size
- How Good Are Popular Matchings
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Popular matchings with two-sided preference lists and matroid constraints
- Two problems in max-size popular matchings
- Popular matchings in the stable marriage problem
This page was built for publication: Popular matchings with multiple partners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136309)