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

The Upper Confidence Bounds (UCB) algorithm is a wellknown near-optimal strategy for the stochastic multi-armed bandit problem. Its extensions to trees, such as the Upper Confidence Tree (UCT) algorithm, have resulted in good solutions to the problem of Go. This paper introduces DUCT, a distributed algorithm inspired by UCT, for solving Distributed Constraint Optimization Problems (DCOP). Bounds on the solution quality are provided, and experiments show that, compared to existing DCOP approaches, DUCT is able to solve very large problems much more efficiently, or to find significantly higher quality solutions.

Authors

• Brammert Ottens EPFL
• Christos Dimitrakakis Université de Neuchâtel
• Boi Faltings EPFL, Switzerland

Keywords

No keywords are indexed for this paper.