Popular matchings in the marriage and roommates problems
From MaRDI portal
Publication:3562995
DOI10.1007/978-3-642-13073-1_10zbMATH Open1284.05268OpenAlexW1523000149MaRDI QIDQ3562995FDOQ3562995
Robert W. Irving, David F. Manlove, Péter Biró
Publication date: 28 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://eprints.gla.ac.uk/39469/1/39469.pdf
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Matching models (91B68)
Cited In (39)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- Popular Matchings in Complete Graphs
- Finding and Recognizing Popular Coalition Structures
- Maintaining Near-Popular Matchings
- Popular Matchings in the Stable Marriage Problem
- Random Popular Matchings with Incomplete Preference Lists
- A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
- Popular branchings and their dual certificates
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Popular Branchings and Their Dual Certificates
- The Generalized Popular Condensation Problem
- Popular and clan-popular \(b\)-matchings
- Popularity, Mixed Matchings, and Self-Duality
- Popularity on the roommate diversity problem
- Popular Matchings
- A social choice approach to ordinal group activity selection
- How Good Are Popular Matchings
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Finding popular branchings in vertex-weighted digraphs
- It is difficult to tell if there is a Condorcet spanning tree
- Unpopularity factor in the marriage and roommates problems
- Popular critical matchings in the many-to-many setting
- Unpopularity factor in the Marriage and Roommates problems
- Popular edges and dominant matchings
- Popular matchings in complete graphs
- Understanding Popular Matchings via Stable Matchings
- Popularity on the roommate diversity problem
- Popular matchings with two-sided preference lists and matroid constraints
- Popular matchings with weighted voters
- Critical Relaxed Stable Matchings with Two-Sided Ties
- Title not available (Why is that?)
- Finding popular branchings in vertex-weighted directed graphs
- Two problems in max-size popular matchings
- Recognizing when a preference system is close to admitting a master list
- Computational complexity of \(k\)-stable matchings
- Stable matchings, one-sided ties, and approximate popularity
- Popular Matchings with Lower Quotas
- Title not available (Why is that?)
This page was built for publication: Popular matchings in the marriage and roommates problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562995)
