Pages that link to "Item:Q3485870"

The following pages link to NP-complete stable matching problems (Q3485870):

Displaying 50 items.

• The hospitals/residents problem with lower quotas (Q261379) (← links)
• Matching couples with Scarf's algorithm (Q314433) (← links)
• Stable matchings of teachers to schools (Q329714) (← links)
• Integer programming methods for special college admissions problems (Q346530) (← links)
• Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
• An algorithm for a super-stable roommates problem (Q650948) (← links)
• Stability and Nash implementation in matching markets with couples (Q708931) (← links)
• Paths to stability for matching markets with couples (Q864893) (← links)
• Finding all stable matchings with couples (Q908185) (← links)
• Size versus stability in the marriage problem (Q964402) (← links)
• Keeping partners together: Algorithmic results for the hospitals/residents problem with couples (Q975759) (← links)
• Geometric stable roommates (Q976079) (← links)
• Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
• An unfeasible matching problem (Q1182611) (← links)
• Stable marriage and indifference (Q1317047) (← links)
• Approximability results for stable marriage problems with ties. (Q1426466) (← links)
• Hard variants of stable marriage. (Q1605313) (← links)
• ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
• Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
• The stable roommates problem with short lists (Q1733384) (← links)
• Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
• Fractional solutions for capacitated NTU-games, with applications to stable matchings (Q1751188) (← links)
• Stable matchings and preferences of couples (Q1772667) (← links)
• Stable partitions with \(\mathcal W\)-preferences (Q1827807) (← links)
• The stable crews problem (Q1827831) (← links)
• Three-sided stable matchings with cyclic preferences (Q1959723) (← links)
• Housing markets through graphs (Q1959727) (← links)
• Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
• Stable matching of student-groups to dormitories (Q2140313) (← links)
• Non-existence of stable social groups in information-driven networks (Q2158297) (← links)
• Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
• Splitting a configuration in a simplex (Q2366245) (← links)
• The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
• Pareto optimality in coalition formation (Q2437839) (← links)
• Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
• Some things couples always wanted to know about stable matchings (but were afraid to ask) (Q2463787) (← links)
• Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
• The exchange-stable marriage problem (Q2576343) (← links)
• Testing substitutability of weak preferences (Q2637415) (← links)
• The Stable Roommates Problem with Short Lists (Q2819460) (← links)
• MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY (Q2854007) (← links)
• Stability in Large Matching Markets with Complementarities (Q2931695) (← links)
• COALITION FORMATION GAMES: A SURVEY (Q3444827) (← links)
• Size Versus Stability in the Marriage Problem (Q3602826) (← links)
• How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
• Strategic Issues in One-to-One Matching with Externalities (Q5013394) (← links)
• A General Framework for Stable Roommates Problems using Answer Set Programming (Q5140025) (← links)
• Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)