Popular and clan-popular \(b\)-matchings
From MaRDI portal
Publication:2250455
DOI10.1016/j.tcs.2014.04.017;zbMath1422.91558MaRDI QIDQ2250455
Publication date: 7 July 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://www.sciencedirect.com/science/article/pii/S0304397514002965/pdfft?isDTMRedir=true&download=true
Related Items (3)
Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Minimal envy and popular matchings ⋮ Popular matchings with two-sided preference lists and matroid constraints
Cites Work
- Optimal popular matchings
- Popular matchings in the weighted capacitated house allocation problem
- General factors of graphs
- Matching theory
- Rank-maximal matchings
- Bounded Unpopularity Matchings
- Popular Matchings
- Popular Matchings in the Marriage and Roommates Problems
- Weighted Popular Matchings
- Popular Mixed Matchings
- Planar 3DM is NP-complete
- Popular Matchings: Structure and Algorithms
- Voting Paths
- Popular Matchings in the Capacitated House Allocation Problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
This page was built for publication: Popular and clan-popular \(b\)-matchings