Stable matching with uncertain pairwise preferences
Stable matching with uncertain pairwise preferences
复制标题
具有不确定的成对偏好的稳定匹配
DOI:
10.1016/j.tcs.2022.01.028
复制
发表时间:
2022
影响因子:
1.1
通讯作者:
Aziz H
中科院分区:
文献类型:
--
作者:
Aziz H
We study a two-sided matching problem where the agents have independent pairwise preferences on their possible partners and these preferences may be uncertain. In this case, the certainly preferred part of an agent’s preferences may admit a cycle and there may not even exist a matching that is stable with non-zero probability. We focus on the computational problems of checking the existence of possibly and certainly stable matchings, ie, matchings whose probability of being stable is positive or one, respectively. We show that finding a possibly stable matching is NP-hard, even if only one side can have cyclic preferences. On the other hand we show that the problem of finding a certainly stable matching is polynomial-time solvable if only one side can have cyclic preferences and the other side has transitive preferences, but that this problem becomes NP-hard when both sides can have cyclic preferences. The latter complexity result also implies the hardness of finding a kernel in a special class of directed graphs.
登录
查看更多内容
DOI:
--
发表时间:
2014
期刊:
ACM Conference on Economics and Computation
影响因子:
--
作者:
Baharak Rastegari;A. Condon;Nicole Immorlica;Robert W. Irving;Kevin Leyton
通讯作者:
Kevin Leyton
DOI:
--
发表时间:
2016
期刊:
Adaptive Agents and Multi-Agent Systems
影响因子:
--
作者:
H. Aziz;Ronald de Haan;Baharak Rastegari
通讯作者:
Baharak Rastegari
影响因子:
1.1
作者:
H. Aziz;P. Biró;Serge Gaspers;Ronald de Haan;Nicholas Mattei;Baharak Rastegari
通讯作者:
H. Aziz;P. Biró;Serge Gaspers;Ronald de Haan;Nicholas Mattei;Baharak Rastegari
影响因子:
14.4
作者:
H. Aziz;P. Biró;Ronald de Haan;Baharak Rastegari
通讯作者:
Baharak Rastegari
DOI:
--
发表时间:
2018
期刊:
Symposium on Theoretical Aspects of Computer Science
影响因子:
--
作者:
Ágnes Cseh;Attila Juhos
通讯作者:
Attila Juhos