The Distributed Stable Marriage Problem
Ismel Brito and Pedro Meseguer
Abstract
The Stable Marrige problem is a combinatorial problem which
can be solved by a centralized algorithm in polinomial 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 the problem, providing
two solving algorithms (one specialized, one generic) that kepp privacy.
We give empirical results on these algorithms.