DUCT: An upper confidence bound approach to distributed constraint optimization problems

The Upper Confidence Bounds (UCB) algorithm is a well-known 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. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.


Published in:
Proceedings of the National Conference on Artificial Intelligence, 1, null, 528-534
Year:
2012
Laboratories:




 Record created 2014-03-11, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)