In this talk I will introduce a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm, to efficiently solve DCOPs. I will show the generality of Action-GDL by proving that it has DPOP, one of the low-complexity, state-of-the-art algorithm to solve DCOPs, as a particular case and providing empirical evidences of the improvement in terms of computation, communication and parallelism needed to solve the problem.