Popularity on the roommate diversity problem

DOI10.1016/J.TCS.2024.114903MaRDI QIDQ6652435zbMATH OpenFDO

Authors Steven Ge, Toshiya Itoh

Publication date 12 December 2024

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

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114903

zbMATH Keywords

algorithmscoalition formationstable marriage problemstable matchingdichotomous preferencesstable roommates problempopularitytrichotomous preferencesco-NP-hardness

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Recommendations

• Popularity on the roommate diversity problem
• Popular matchings in the marriage and roommates problems
• Popular matching in roommates setting is \textsf{NP}-hard

Cites work

• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Finding and Recognizing Popular Coalition Structures
• Hedonic diversity games revisited
• On the existence of stable roommate matchings
• Popular matchings and limits to tractability
• Popular matchings in complete graphs
• Popular matchings in the marriage and roommates problems
• Scaling algorithms for weighted matching in general graphs
• Stable matching with preferences derived from a psychological model
• Zur Theorie der Gesellschaftsspiele.

Cited in

(1)

• Popularity on the roommate diversity problem

This page was built for publication: Popularity on the roommate diversity problem

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