Unpopularity factor in the marriage and roommates problems
From MaRDI portal
Publication:2043880
DOI10.1007/s00224-020-09978-5OpenAlexW2795254914MaRDI QIDQ2043880
Toshiya Itoh, Suthee Ruangwises
Publication date: 3 August 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.09435
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Popular matchings in the weighted capacitated house allocation problem
- Unpopularity factor in the Marriage and Roommates problems
- Popular matchings in complete graphs
- Near-Popular Matchings in the Roommates Problem
- Bounded Unpopularity Matchings
- Popular Matchings in the Marriage and Roommates Problems
- Weighted Popular Matchings
- Popular Mixed Matchings
- An efficient algorithm for the “stable roommates” problem
- Scaling Algorithms for Weighted Matching in General Graphs
- Scaling Algorithms for the Shortest Paths Problem
- Popular Matching in Roommates Setting Is NP-hard
- Popular Matchings and Limits to Tractability
- Random Popular Matchings with Incomplete Preference Lists
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Dynamic Matching Markets and Voting Paths
- College Admissions and the Stability of Marriage
This page was built for publication: Unpopularity factor in the marriage and roommates problems
