Stable marriage and indifference
From MaRDI portal
Publication:1317047
DOI10.1016/0166-218X(92)00179-PzbMATH Open0796.05078DBLPjournals/dam/Irving94WikidataQ56389705 ScholiaQ56389705MaRDI QIDQ1317047FDOQ1317047
Publication date: 20 September 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- NP-complete stable matching problems
- College Admissions and the Stability of Marriage
- An efficient algorithm for the “stable roommates” problem
- Lower Bounds for the Stable Marriage Problem and Its Variants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (74)
- Hardness and approximation results for some variants of stable marriage problem
- Strongly stable and maximum weakly stable noncrossing matchings
- Characterization of super-stable matchings
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- The structure of stable marriage with indifference
- Stable marriage with ties and bounded length preference lists
- Title not available (Why is that?)
- Stable Matching with Uncertain Linear Preferences
- Pareto Stable Matchings under One-Sided Matroid Constraints
- An advanced parking navigation system for downtown parking
- Title not available (Why is that?)
- The stable marriage problem with master preference lists
- Improving solution times for stable matching problems through preprocessing
- Algorithms and complexity of strongly stable non-crossing matchings
- Maximum stable matching with one-sided ties of bounded length
- Randomized approximation of the stable marriage problem
- Gainers and losers from market integration
- Random matching under priorities: stability and no envy concepts
- Approximability results for stable marriage problems with ties.
- Pareto stability in two-sided many-to-many matching with weak preferences
- Stable matchings in the marriage model with indifferences
- Stable matching with uncertain linear preferences
- From One Stable Marriage to the Next: How Long Is the Way?
- The stable fixtures problem -- a many-to-many extension of stable roommates
- Incentivizing resilience in financial networks
- Strategic issues in college admissions with score-limits
- Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
- Borda-induced hedonic games with friends, enemies, and neutral players
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences
- Unpopularity factor in the Marriage and Roommates problems
- Stable partitions with \(\mathcal W\)-preferences
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)
- A stable marriage requires communication
- Jointly stable matchings
- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
- Envy-free matchings with one-sided preferences and matroid constraints
- On the complexity of exchange-stable roommates
- Solving stable matching problems using answer set programming
- Hard variants of stable marriage.
- Circular stable matching and 3-way kidney transplant
- Bounded unpopularity matchings
- Strategy-proof contract auctions and the role of ties
- The stable marriage problem with ties and restricted edges
- On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- COALITION FORMATION GAMES: A SURVEY
- Robust and approximately stable marriages under partial information
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Stable marriage with general preferences
- Efficient algorithms for generalized stable marriage and roommates problems
- A Matroid Generalization of the Super-Stable Matching Problem
- Parameterized algorithms for stable matching with ties and incomplete lists
- Review of the theory of stable matchings and contract systems
- A Stable Marriage Requires Communication
- Mathematical models for stable matching problems with ties and incomplete lists
- Stability, optimality and manipulation in matching problems with weighted preferences
- Marriage market with indifferences: a linear programming approach
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- Pairwise Preferences in the Stable Marriage Problem
- Core and stability notions in many-to-one matching markets with indifferences
- Title not available (Why is that?)
- Super-stability in the student-project allocation problem with ties
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Stable dinner party seating arrangements
- Balancing stability and efficiency in team formation as a generalized roommate problem
- A New Approach to the Pareto Stable Matching Problem
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
- The Price of Matching with Metric Preferences
- A simple matching domain with indifferences and a master list
- Pareto efficient matchings with pairwise preferences
- On a many-sided matching problem with mixed preferences
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
- Multi-agent reinforcement learning for decentralized stable matching
This page was built for publication: Stable marriage and indifference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317047)
