|Título||Distributed Stable Marriage Problem|
|Publication Type||Conference Paper|
|Year of Publication||2005|
|Authors||Brito I, Meseguer P|
|Conference Name||Distributed Constraint Reasoning (DCR05) Proceedings of the Sixth International Workshop Edinburgh, Scotland, 30 July, 2005|
|Paginación||135 - 147|
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.
- Acerca del IIIA