稳定的婚姻与多模态偏好
Stable Marriage with Multi-Modal Preferences
摘要:
我们介绍了一个广义版本的著名的稳定婚姻问题,现在基于多模态偏好列表。这里的中心扭曲是允许每个代理基于一个以上的“评估模式”(例如,不止一个标准);因此,每个代理配备有多个偏好列表,每个偏好列表以可能不同的方式对对应方进行排序。我们介绍和研究三个自然的概念的稳定性,调查他们的相互关系,并专注于计算复杂性方面的计算稳定的匹配,在这些新的情况。在大多数情况下遇到计算困难(NP困难),我们也可以发现一些易处理的岛屿,并与\textsc{Graph Isomorphism}问题建立惊人的联系。
英文摘要:
We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one "evaluation mode" (e.g., more than one criterion); thus, each agent is equipped with multiple preference lists, each ranking the counterparts in a possibly different way. We introduce and study three natural concepts of stability, investigate their mutual relations and focus on computational complexity aspects with respect to computing stable matchings in these new scenarios. Mostly encountering computational hardness (NP-hardness), we can also spot few islands of tractability and make a surprising connection to the \textsc{Graph Isomorphism} problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。