Pages that link to "Item:Q2384396"
From MaRDI portal
The following pages link to The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396):
Displaying 16 items.
- Rotations in the stable \(b\)-matching problem (Q964393) (← links)
- A polynomial-time algorithm for the bistable roommates problem (Q1604203) (← links)
- The stable fixtures problem with payments (Q1651275) (← links)
- The stable tournament problem: matching sports schedules with preferences (Q1728308) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- The integral stable allocation problem on graphs (Q1952506) (← links)
- Subjective homophily and the fixtures problem (Q2221249) (← links)
- On the stable \(b\)-matching problem in multigraphs (Q2476254) (← links)
- Finding all stable pairs and solutions to the many-to-many stable matching problem (Q2815443) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- The Stable Roommates Problem with Ties (Q3150272) (← links)
- A General Framework for Stable Roommates Problems using Answer Set Programming (Q5140025) (← links)
- Stable Roommates and Constraint Programming (Q5418725) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Stable and meta-stable contract networks (Q6051063) (← links)
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042) (← links)