Computational complexity of k-stable matchings
From MaRDI portal
Publication:6546302
DOI10.1007/978-3-031-43254-5_18zbMATH Open1539.91085MaRDI QIDQ6546302FDOQ6546302
Authors: Haris Aziz, Gergely Csáji, Ágnes Cseh 
Publication date: 29 May 2024
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- College Admissions and the Stability of Marriage
- A tale of two mechanisms: Student placement
- Algorithms and Computation
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Incentive compatibility in a market with indivisible goods
- Popular ranking
- Popular matchings in the marriage and roommates problems
- Popular spanning trees
- Random Matching Under Dichotomous Preferences
- Popular Matchings
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- A necessary and sufficient condition for the existence of a complete stable matching
- An efficient algorithm for the “stable roommates” problem
- Popular matchings and limits to tractability
- A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
- Pareto optimality in many-to-many matching problems
- Pareto optimal matchings in many-to-many markets with ties
- Popular mixed matchings
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- On the number of criteria needed to decide Pareto optimality
- Bounded unpopularity matchings
- Pareto optimality in coalition formation
- Supporting weakly Pareto optimal allocations in infinite dimensional nonconvex economies
- A social choice approach to ordinal group activity selection
- Popular matchings in the stable marriage problem
- On Pareto optimality in social distance games
- Price of Pareto optimality in hedonic games
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Complexity of finding Pareto-efficient allocations of highest welfare
- Unpopularity factor in the marriage and roommates problems
- Popular matchings in complete graphs
- Popular branchings and their dual certificates
- Popular matchings with two-sided preferences and one-sided ties
- Maintaining Near-Popular Matchings
- Near-popular matchings in the roommates problem
- Popularity, Mixed Matchings, and Self-Duality
- On weakly and strongly popular rankings
- The popular assignment problem: when cardinality is more important than popularity
This page was built for publication: Computational complexity of \(k\)-stable matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546302)
