Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
Loading...
Access rights
openAccess
CC BY
CC BY
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Authors
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
20
Series
28th International Conference on Principles of Distributed Systems (OPODIS 2024), Leibniz International Proceedings in Informatics (LIPIcs) ; Volume 324
Abstract
Stable matching is a fundamental problem studied both in economics and computer science. The task is to find a matching between two sides of agents that have preferences over who they want to be matched with. A matching is stable if no pair of agents prefer each other over their current matches. The deferred acceptance algorithm of Gale and Shapley solves this problem in polynomial time. Further, it is a mechanism: the proposing side in the algorithm is always incentivised to report their preferences truthfully. The deferred acceptance algorithm has a natural interpretation as a distributed algorithm (and thus a distributed mechanism). However, the algorithm is slow in the worst case and it is known that the stable matching problem cannot be solved efficiently in the distributed setting. In this work we study a natural special case of the stable matching problem where all agents on one of the two sides share common preferences. We show that in this case the deferred acceptance algorithm does yield a fast and truthful distributed mechanism for finding a stable matching. We show how algorithms for sampling random colorings can be used to break ties fairly and extend the results to fractional stable matching.Description
Other note
Citation
Hirvonen, J & Ranjbaran, S 2025, Fast, Fair and Truthful Distributed Stable Matching for Common Preferences. in S Bonomi, L Galletta, E Riviere & V Schiavoni (eds), 28th International Conference on Principles of Distributed Systems (OPODIS 2024)., 30, Leibniz International Proceedings in Informatics (LIPIcs), vol. 324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, International Conference on Principles of Distributed Systems, Lucca, Italy, 11/12/2024. https://doi.org/10.4230/LIPIcs.OPODIS.2024.30