Pages that link to "Item:Q428844"

The following pages link to ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844):

Displaying 13 items.

• Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
• ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
• The stable roommates problem with short lists (Q1733384) (← links)
• Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
• Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
• Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
• Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
• The Stable Roommates Problem with Short Lists (Q2819460) (← links)
• Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability (Q3449578) (← links)
• How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
• A General Framework for Stable Roommates Problems using Answer Set Programming (Q5140025) (← links)
• Balanced stable marriage: how close is close enough? (Q5918373) (← links)
• Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)