Work

DUCT: An Upper Confidence Bound Approach to Distributed Constraint Optimization Problems

Year: 2017
Type: article
Abstract: We propose a distributed upper confidence bound approach, DUCT, for solving distributed constraint optimization problems. We compare four variants of this approach with a baseline random sampling algorithm, as well as other complete and incomplete algorithms for DCOPs. Under general assumptions, we theoretically show that the solution found by DUCT after T steps is approximately T −1 -close to the optimal. Experimentally, we show that DUCT matches the optimal solution found by the well-known DPOP and O-DPOP algorithms on moderate-size problems, while always requiring less agent communication. For larger problems, where DPOP fails, we show that DUCT produces significantly better solutions than local, incomplete algorithms. Overall, we believe that DUCT is a practical, scalable algorithm for complex DCOPs.
Language: English
Open Access status: green
OpenAlex ID: W2735020746
FWCI: 1.875
Cites: 47
Cited by: 47
Related to: 10