Upper bounds for stabilization in acyclic preference-based systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
Participants in a decentralized system often use some local ranking information in selecting effective collaborations. We say that such systems are preference-based. For most practical types of preferences, such systems converge towards a unique stable configuration. In this paper, we investigate the speed and quality of the convergence process with respect to the model parameters. Our results provide insight into the design of system parameters, such as the number of connections or the algorithm for choosing new partners.