No article text was recorded for this version.
constrained matching complexity
Version 1 of 1143 papers267 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Stable Matching with Uncertain Linear Preferences
- Blog: From Matching with Diversity Constraints to Matching with Regional Quotas
- Blog: Stable Hypergraph Matching in Unimodular Hypergraphs
- Blog: Stable Matching Games: Manipulation via Subgraph Isomorphism
- Blog: Stable Matching with Uncertain Linear Preferences
- Blog: Optimal Capacity Modification for Stable Matchings with Ties
- Blog: Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
- Blog: Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
- Blog: Profile-based optimal stable matchings in the Roommates problem
- Blog: Socially Stable Matchings in the Hospitals/Residents Problem
- Blog: FPT-Approximability of Stable Matching Problems
- Blog: Socially Stable Matchings
- Blog: Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
- Blog: Preference Swaps for the Stable Matching Problem
- Blog: Modeling Stable Matching Problems with Answer Set Programming
- Blog: On (Coalitional) Exchange-Stable Matching
- Blog: Cutoff stability under distributional constraints with an application to summer internship matching
- Blog: A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
- Blog: GPL4SRec: Graph Multi-Level Aware Prompt Learning for Streaming Recommendation
- Blog: Optimal Capacity Modification for Many-To-One Matching Problems
- Blog: Stable Marriage with Covering Constraints: A Complete Computational Trichotomy
- Blog: Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas
- Blog: On the (Parameterized) Complexity of Almost Stable Marriage
- Blog: Manipulating the outcome of stable matching and roommates problems
- Blog: Popularity and Perfectness in One-sided Matching Markets with Capacities
- Blog: Bribery and Control in Stable Marriage
- Blog: Stable marriage with general preferences
- Blog: A Stable Marriage Requires Communication
- Blog: Cutoff stability under distributional constraints with an application to summer internship matching
- Blog: A stable marriage requires communication
- Blog: Matchings under Preferences: Strength of Stability and Tradeoffs
- Blog: Pareto optimal and popular house allocation with lower and upper quotas
- Blog: Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
- Blog: Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples
- Blog: Ex-post Stability under Two-Sided Matching: Complexity and Characterization
- Blog: The popular assignment problem: when cardinality is more important than popularity
- Blog: Stable Fractional Matchings
- Blog: Popular Matchings and Limits to Tractability
- Blog: Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
- Blog: Stable marriage and roommate problems with individual-based stability
- Blog: Stable Marriage with Multi-Modal Preferences
- Blog: Fractional Matchings under Preferences: Stability and Optimality
- Blog: Diversity Constraints in Public Housing Allocation
- Blog: The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing up Your Home?
- Blog: Near-Feasible Solutions to Complex Stable Matching Problems
- Blog: Socially stable matchings in the Hospitals / Residents problem
- Blog: Maximum-utility Popular Matchings with Bounded Instability
- Blog: Approximately Stable Matchings With Budget Constraints
- Blog: Matchings under Preferences: Strength of Stability and Trade-offs
- Blog: Summer Internship Matching with Funding Constraints
- Blog: Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise
- Blog: Popular Maximum-Utility Matchings with Matroid Constraints
- Blog: Popular Matching in Roommates Setting is NP-hard
- Blog: Affinely Representable Lattices, Stable Matchings, and Choice Functions
- Blog: Balanced Stable Marriage: How Close is Close Enough?
- Blog: Adapting Stable Matchings to Forced and Forbidden Pairs
- Blog: How Hard Is It to Satisfy (Almost) All Roommates?
- Blog: Solving the Maximum Popular Matching Problem with Matroid Constraints
- Blog: Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching
- Blog: Computational complexity of k-stable matchings
Showing 60 of 143 papers.
History & citation
Current · Permanent link
- The Computational Limits of Constrained Matching Markets merged into this direction (94% overlap)
- Computational Limits of Stable Matching with Constraints merged into this direction (90% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_constrained_matching_complexity_5c20ee81,
title = {constrained matching complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constrained-matching-complexity/rdr_5c20ee8168d24cd9841cdd37a1691088},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_constrained_matching_complexity_5c20ee81_v1,
title = {constrained matching complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constrained-matching-complexity/rdr_5c20ee8168d24cd9841cdd37a1691088/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}