Decentralized social algorithm for committee coordination problem

In this paper, we consider an extended committee coordination problem in an autonomous decentralized social environment. The basic committee coordination problem and a distributed algorithm, as a solution to this problem in distributed environment, are presented by K.M. Chandy and J. Misra in [1]. The algorithm guarantees the synchronous and exclusion properties of the problem and is fair (i.e. starvation-free) and makes progress (i.e. deadlock-free). In an autonomous decentralized social environment, besides the above mentioned properties, some social properties, such as individual preference[2], privacy protection[2], and stable assignment[3], are required to be considered and guaranteed. In this paper, we extend the committee coordination problem by introducing some social properties, such as individual preference and stable assignment and give a decentralized social algorithm as a solution to this extended problem. The algorithm guarantees not only the synchronous and exclusion properties but also individual preference and stable assignment properties.