为无法满足的室友匹配问题生成个性化可接受解
Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems
- 结合偏好与好友网络，生成个性化匹配方案
- 在无稳定解时仍能给出可接受的近似解
- 适合实际场景中需妥协的配对需求
稳定室友问题描述了个体基于彼此偏好选择室友的场景。一个解是将所有人配成互相可接受的配对，且匹配是稳定的（即不存在两人更偏好彼此而非当前室友）。由于现实中稳定解未必存在，我们研究如何计算‘足够好’的匹配。除了个体偏好外，还引入其好友偏好网络，提出一种生成个性化解决方案的方法。通过实例和实证评估验证了该方法的有效性。
原文摘要 · Abstract (English)
The Stable Roommates problems are characterized by the preferences of agents over other agents as roommates. A solution is a partition of the agents into pairs that are acceptable to each other (i.e., they are in the preference lists of each other), and the matching is stable (i.e., there do not exist any two agents who prefer each other to their roommates, and thus block the matching). Motivated by real-world applications, and considering that stable roommates problems do not always have solutions, we continue our studies to compute "good-enough" matchings. In addition to the agents' habits and habitual preferences, we consider their networks of preferred friends, and introduce a method to generate personalized solutions to stable roommates problems. We illustrate the usefulness of our method with examples and empirical evaluations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。