Egalitarian roommate allocations: complexity and stability

DOI10.1016/J.TCS.2024.115009MaRDI QIDQ6658303

Helena Rivera Dallorto, Vincenzo Bonifaci

Publication date: 8 January 2025

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

perfect matchingcoalition formationhedonic gamesenvy-freenessroommate problem\( \mathsf{NP} \)-hardness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The stability of hedonic coalition structures
• The stable roommates problem with short lists
• Packing triangles in bounded degree graphs.
• Partition into triangles on bounded degree graphs
• Three-Dimensional Stabl Matching Problems
• Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
• An efficient algorithm for the “stable roommates” problem
• Three Fast Algorithms for Four Problems in Stable Marriage
• Algorithmics of Matching Under Preferences
• Paths, Trees, and Flowers
• College Admissions and the Stability of Marriage

This page was built for publication: Egalitarian roommate allocations: complexity and stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658303)