Popular matchings in the marriage and roommates problems
From MaRDI portal
Publication:3562995
DOI10.1007/978-3-642-13073-1_10zbMATH Open1284.05268OpenAlexW1523000149MaRDI QIDQ3562995FDOQ3562995
Authors: Péter Biró, Robert W. Irving, David F. Manlove 
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 (47)
- The generalized popular condensation problem
- Popular Matchings in Complete Graphs
- Finding and Recognizing Popular Coalition Structures
- Popular matchings with two-sided preferences and one-sided ties
- Understanding popular matchings via stable matchings
- Maintaining Near-Popular Matchings
- Popularity, mixed matchings, and self-duality
- A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
- Popularity vs maximum cardinality in the stable marriage setting
- Popular branchings and their dual certificates
- Counting popular matchings in house allocation problems
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Popular and clan-popular \(b\)-matchings
- Near-popular matchings in the roommates problem
- Popular matchings with multiple partners
- Popular matchings with lower quotas
- 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
- Random popular matchings with incomplete preference lists
- Near-popular matchings in the roommates problem
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Popular matching in roommates setting is NP-hard
- 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
- Quasi-popular matchings, optimality, and extended formulations
- Popular edges and dominant matchings
- Popular matchings in complete graphs
- Popular matchings with two-sided preferences and one-sided ties
- Popular branchings and their dual certificates
- Popular Matchings in the Capacitated House Allocation Problem
- 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
- Popular matching in roommates setting is \textsf{NP}-hard
- Finding popular branchings in vertex-weighted directed graphs
- Two problems in max-size popular matchings
- Popular matchings in the stable marriage problem
- 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
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)
