Popular matchings with variable item copies
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cites work
- scientific article; zbMATH DE number 863471 (Why is no real title available?)
- Algorithms and Computation
- Bounded Unpopularity Matchings
- Popular Matchings
- Popular Matchings in the Capacitated House Allocation Problem
- Popular Mixed Matchings
- Popular matchings with variable job capacities
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Rank-maximal matchings
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- The complexity of satisfiability problems
- The stable marriage problem with master preference lists
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT
- Weak versus strong domination in a market with indivisible goods
- Weighted Popular Matchings
Cited in
(7)- Minimal envy and popular matchings
- The generalized popular condensation problem
- Maintaining Near-Popular Matchings
- Popular matchings of desired size
- Popular matchings with ties and matroid constraints
- The popular matching and condensation problems under matroid constraints
- Popular matchings with variable job capacities
This page was built for publication: Popular matchings with variable item copies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631788)