Computational complexity of k-stable matchings
From MaRDI portal
Publication:6546302
Recommendations
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- A necessary and sufficient condition for the existence of a complete stable matching
- A social choice approach to ordinal group activity selection
- A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
- A tale of two mechanisms: Student placement
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Algorithms and Computation
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- An efficient algorithm for the “stable roommates” problem
- Bounded unpopularity matchings
- College Admissions and the Stability of Marriage
- Complexity of finding Pareto-efficient allocations of highest welfare
- Incentive compatibility in a market with indivisible goods
- Maintaining Near-Popular Matchings
- Near-popular matchings in the roommates problem
- On Pareto optimality in social distance games
- On the number of criteria needed to decide Pareto optimality
- On weakly and strongly popular rankings
- Pareto optimal matchings in many-to-many markets with ties
- Pareto optimality in coalition formation
- Pareto optimality in many-to-many matching problems
- Popular Matchings
- Popular branchings and their dual certificates
- Popular matchings and limits to tractability
- Popular matchings in complete graphs
- Popular matchings in the marriage and roommates problems
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- Popular mixed matchings
- Popular ranking
- Popular spanning trees
- Popularity, Mixed Matchings, and Self-Duality
- Price of Pareto optimality in hedonic games
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Random Matching Under Dichotomous Preferences
- Supporting weakly Pareto optimal allocations in infinite dimensional nonconvex economies
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- The popular assignment problem: when cardinality is more important than popularity
- Unpopularity factor in the marriage and roommates problems
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)
