Multi-Objective Distributed Pseudo-Tree Optimization

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.

Authors

• Maxime Clement
• Tenda Okimoto
• Katsumi Inoue National Institute of Informatics

Keywords

No keywords are indexed for this paper.