Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs

Meritxell Vinyals, Juan A. Rodríguez-Aguilar, Jesús Cerquides

Abstract: In this paper we make three main contributions (fully detailed in [5]). Firstly, we formulate a new algorithm, the so-called Action-GDL, which extends GDL [1] to apply it to Distributed Constraint Optimization Problems (DCOPs). Secondly, we show that Action-GDL generalizes DPOP[4], a low-complexity, state-of-the-art algorithm to solve DCOPs. Finally, we provide empirical evidence showing that Action-GDL can outperform DPOP in terms of the amount of computation, communication and parallelism.