Recognizing when a preference system is close to admitting a master list

DOI10.1007/978-3-031-27051-2_27arXiv2212.03521MaRDI QIDQ6091175

Ildikó Schlotter

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.03521

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the parameterized complexity of multiple-interval graph problems
• The stable marriage problem with master preference lists
• Fixed-parameter algorithms for Kemeny rankings
• Solving hard stable matching problems involving groups of similar agents
• A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
• Multidimensional stable roommates with master list
• Distributed stable matching with similar preference lists
• The Stable Roommates Problem with Globally Ranked Pairs
• On the power of unique 2-prover 1-round games
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• Algorithmics of Matching Under Preferences
• Parameterized Algorithms
• Digraphs
• College Admissions and the Stability of Marriage
• A simple matching domain with indifferences and a master list

This page was built for publication: Recognizing when a preference system is close to admitting a master list