Distributed Stable Marriage Problem ? (original) (raw)

2000

Abstract

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 deflne the distributed version of this prob- lem, and we provide a constraint-based approach that solves it keeping privacy. We give empirical

Ismel Brito hasn't uploaded this paper.

Let Ismel know you want this paper to be uploaded.

Ask for this paper to be uploaded.