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