The following pages link to Stable marriage and indifference (Q1317047):
Displayed 50 items.
- Stable marriage with general preferences (Q506532) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences (Q637586) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- The stable marriage problem with ties and restricted edges (Q783028) (← links)
- Characterization of super-stable matchings (Q832893) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- The structure of stable marriage with indifference (Q1613420) (← links)
- Incentivizing resilience in financial networks (Q1655678) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
- Strategic issues in college admissions with score-limits (Q1728163) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- Stable partitions with \(\mathcal W\)-preferences (Q1827807) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Circular stable matching and 3-way kidney transplant (Q1959729) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- An advanced parking navigation system for downtown parking (Q2005880) (← links)
- Strategy-proof contract auctions and the role of ties (Q2016246) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- Stable matchings in the marriage model with indifferences (Q2059169) (← links)
- Envy-free matchings with one-sided preferences and matroid constraints (Q2060385) (← links)
- Gainers and losers from market integration (Q2127893) (← links)
- Robust and approximately stable marriages under partial information (Q2190410) (← links)
- On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences (Q2197901) (← links)
- Stable matching with uncertain linear preferences (Q2309477) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- Random matching under priorities: stability and no envy concepts (Q2325654) (← links)
- The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
- Jointly stable matchings (Q2424832) (← links)
- Pareto stability in two-sided many-to-many matching with weak preferences (Q2425160) (← links)
- Pareto efficient matchings with pairwise preferences (Q2683505) (← links)
- Marriage market with indifferences: a linear programming approach (Q2687690) (← links)
- Multi-agent reinforcement learning for decentralized stable matching (Q2695458) (← links)
- Stable Matching with Uncertain Linear Preferences (Q2819459) (← links)
- COALITION FORMATION GAMES: A SURVEY (Q3444827) (← links)
- Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints (Q3449577) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Solving stable matching problems using answer set programming (Q4593026) (← links)
- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings (Q5041200) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- A Matroid Generalization of the Super-Stable Matching Problem (Q5084102) (← links)