Computational complexity of $k$-stable matchings

Cites Work

Unnamed Item
Unnamed Item
Pareto optimal matchings in many-to-many markets with ties
Popular mixed matchings
Bounded unpopularity matchings
Incentive compatibility in a market with indivisible goods
Supporting weakly Pareto optimal allocations in infinite dimensional nonconvex economies
Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
A tale of two mechanisms: Student placement
On the number of criteria needed to decide Pareto optimality
A social choice approach to ordinal group activity selection
Popular matchings in the stable marriage problem
Complexity of finding Pareto-efficient allocations of highest welfare
Unpopularity factor in the marriage and roommates problems
Price of Pareto optimality in hedonic games
On Pareto optimality in social distance games
Popular branchings and their dual certificates
Pareto optimality in many-to-many matching problems
Pareto optimality in coalition formation
Popular ranking
A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
Popular matchings in complete graphs
A necessary and sufficient condition for the existence of a complete stable matching
Maintaining Near-Popular Matchings
Popular Matchings
Popular Matchings in the Marriage and Roommates Problems
An efficient algorithm for the “stable roommates” problem
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Popularity, Mixed Matchings, and Self-Duality
Popular Matching in Roommates Setting Is NP-hard
Popular Matchings and Limits to Tractability
Near-Popular Matchings in the Roommates Problem
Algorithmics of Matching Under Preferences
Popular Matchings with Two-Sided Preferences and One-Sided Ties
POPULAR SPANNING TREES
A Size-Popularity Tradeoff in the Stable Marriage Problem
The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
Random Matching Under Dichotomous Preferences
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Algorithms and Computation
College Admissions and the Stability of Marriage
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

Computational complexity of \(k\)-stable matchings