The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
From MaRDI portal
Publication:5458562
DOI10.1007/978-3-540-78773-0_51zbMath1136.91543OpenAlexW1525480452MaRDI QIDQ5458562
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_51
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items (27)
Popular Branchings and Their Dual Certificates ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Maintaining Near-Popular Matchings ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Quasi-Popular Matchings, Optimality, and Extended Formulations ⋮ Popular Matchings: Structure and Algorithms ⋮ The Generalized Popular Condensation Problem ⋮ Finding and Recognizing Popular Coalition Structures ⋮ The dynamics of rank-maximal and popular matchings ⋮ Bounded Unpopularity Matchings ⋮ Popular matchings with variable item copies ⋮ Bounded unpopularity matchings ⋮ Popular matchings: structure and algorithms ⋮ Popular ranking ⋮ Maximum locally stable matchings ⋮ Minimal envy and popular matchings ⋮ Popular Matchings in the Stable Marriage Problem ⋮ Popular and clan-popular \(b\)-matchings ⋮ Popular mixed matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Popularity at minimum cost ⋮ Unpopularity factor in the marriage and roommates problems ⋮ Social Welfare in One-Sided Matching Markets without Money ⋮ Random Popular Matchings with Incomplete Preference Lists ⋮ Unnamed Item ⋮ A pessimist's approach to one-sided matching ⋮ Popular branchings and their dual certificates
This page was built for publication: The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
