Multi-Objective Distributed Pseudo-Tree Optimization

Maxime Clement (National Institute of Informatics), Tenda Okimoto (Kobe University), Katsumi Inoue (National Institute of Informatics)

Abstract

In this paper, we develop a novel MO-DCOP algorithm based on dynamic programming techniques which guarantees to find the complete Pareto front. We also propose a bounded version which reduces the size of the messages using an adjustable parameter.