Stable Matching with Uncertain Linear Preferences
-
Published:2019-11-14
Issue:5
Volume:82
Page:1410-1433
-
ISSN:0178-4617
-
Container-title:Algorithmica
-
language:en
-
Short-container-title:Algorithmica
Author:
Aziz Haris, Biró Péter, Gaspers Serge, de Haan Ronald, Mattei Nicholas, Rastegari BaharakORCID
Abstract
AbstractWe consider the two-sided stable matching setting in which there may be uncertainty about the agents’ preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model—for each agent, there is a probability distribution over linear preferences, (2) compact indifference model—for each agent, a weak preference order is specified and each linear order compatible with the weak order is equally likely and (3) joint probability model—there is a lottery over preference profiles. For each of the models, we study the computational complexity of computing the stability probability of a given matching as well as finding a matching with the highest probability of being stable. We also examine more restricted problems such as deciding whether a certainly stable matching exists. We find a rich complexity landscape for these problems, indicating that the form uncertainty takes is significant.
Funder
Magyar Tudományos Akadémia Országos Tudományos Kutatási Alapprogramok Engineering and Physical Sciences Research Council Australian Research Council Austrian Science Fund UNSW Scientia Fellowship
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference29 articles.
1. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8, 121–123 (1979) 2. Aziz, H., Biró, P., Gaspers, S., de Haan, R., Mattei, N., Rastegari, B.: Stable matching with uncertain linear preferences. In: Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT), pp. 195–206 (2016) 3. Aziz, H., Biró, P., Fleiner, T., Gaspers, S., de Haan, R., Mattei, N., Rastegari, B.: Stable matching with uncertain pairwise preferences. In: Proceedings of the 16th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 344–352 (2017a) 4. Aziz, H., de Haan, R., Rastegari, B.: Pareto optimal allocation under uncertain preferences. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1472–1474 (2017b) 5. Aziz, H., Biró, P., de Haan, R., Rastegari, B.: Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity. Artif. Intell. 276, 57–78 (2019a)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|