TítuloDistributed Stable Marriage Problem
Publication TypeConference Paper
Year of Publication2005
AuthorsBrito I, Meseguer P
EditorMeisels A
Conference NameDistributed Constraint Reasoning (DCR05) Proceedings of the Sixth International Workshop Edinburgh, Scotland, 30 July, 2005
EditorialIJCAI
Paginación135 - 147
Resumen

The Stable Marriage Problem is a combinatorial problem which can be solved by a centralized algorithm in polynomial time. This requires to make public lists of preferences which agents would like to keep private. With this aim, we define the distributed version of this problem, and we provide a constraint-based approach that solves it keeping privacy. We give empirical results on the proposed approach.