Popular matchings in the marriage and roommates problems
From MaRDI portal
Publication:3562995
Recommendations
Cited in
(46)- Popular matchings in complete graphs
- Popular Roommates in Simply Exponential Time.
- Quasi-popular matchings, optimality, and extended formulations
- Popular matchings with two-sided preferences and one-sided ties
- Unpopularity factor in the marriage and roommates problems
- Random popular matchings with incomplete preference lists
- Near-popular matchings in the roommates problem
- Understanding popular matchings via stable matchings
- Popular branchings and their dual certificates
- Popular Matchings in the Capacitated House Allocation Problem
- Popular matchings with weighted voters
- Critical Relaxed Stable Matchings with Two-Sided Ties
- Computational complexity of \(k\)-stable matchings
- Stable matchings, one-sided ties, and approximate popularity
- A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
- How Good Are Popular Matchings
- Popular matchings with two-sided preferences and one-sided ties
- The generalized popular condensation problem
- Popularity on the roommate diversity problem
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Counting popular matchings in house allocation problems
- Near-popular matchings in the roommates problem
- Maintaining Near-Popular Matchings
- Popularity, mixed matchings, and self-duality
- Finding popular branchings in vertex-weighted digraphs
- Popular branchings and their dual certificates
- Popular matchings with multiple partners
- Popular matchings with lower quotas
- Popular Matchings
- Two problems in max-size popular matchings
- Popularity vs maximum cardinality in the stable marriage setting
- Popular matchings in the stable marriage problem
- Popular critical matchings in the many-to-many setting
- Unpopularity factor in the Marriage and Roommates problems
- Popularity, Mixed Matchings, and Self-Duality
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Recognizing when a preference system is close to admitting a master list
- Popularity on the roommate diversity problem
- Popular and clan-popular \(b\)-matchings
- Popular matchings with two-sided preference lists and matroid constraints
- It is difficult to tell if there is a Condorcet spanning tree
- A social choice approach to ordinal group activity selection
- Popular matching in roommates setting is \textsf{NP}-hard
- Finding popular branchings in vertex-weighted directed graphs
- Popular Matchings in Complete Graphs
- Finding and Recognizing Popular Coalition Structures
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)
