Analyzing the performance of distributed algorithms
Robert N. Lass, Evan A. Sultanik, William Clement Regli · 2007
A large class of problems in multiagent systems can be solved by distributed constraint optimization (DCOP). Several algorithms have been created to solve these problems, however, no extensive evaluation of current DCOP algorithms on live networks exists in the literature. This paper uses DCOPolis---a framework for comparing and deploying DCOP software in heterogeneous environments---to contribute an analysis of two state-of-the-art DCOP algorithms solving a number of different problem types. Then, we use this empirical validation to evaluate the use of both cycle-based runtime and concurrent constraint checks.