Popularity on the roommate diversity problem

DOI10.1016/j.tcs.2024.114903MaRDI QIDQ6652435

Steven Ge, Toshiya Itoh

Publication date: 12 December 2024

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

zbMATH Keywords

algorithmsstable marriage problemstable roommates problemstable matchingcoalition formationdichotomous preferencespopularitytrichotomous preferencesco-NP-hardness

Mathematics Subject Classification ID

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

Cites Work

• On the existence of stable roommate matchings
• Stable matching with preferences derived from a psychological model
• Popular matchings in complete graphs
• Hedonic diversity games revisited
• Popular Matchings in the Marriage and Roommates Problems
• Scaling Algorithms for Weighted Matching in General Graphs
• Popular Matching in Roommates Setting Is NP-hard
• Finding and Recognizing Popular Coalition Structures
• Popular Matchings and Limits to Tractability
• Algorithmics of Matching Under Preferences
• Zur Theorie der Gesellschaftsspiele.

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