A Scalable Method for Multiagent Constraint Optimization

By Adrian Petcu, Boi Faltings. International Joint Conference on Artificial Intelligence, 2005

661 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/255ab528055d938663ad3274e9437c711e8e5d99

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Alex Rogers
2. Alessandro Farinelli
3. Nicholas R. Jennings
4. Ruben Stranders
5. Adrian Petcu
6. Harel Yedidsion
7. Chris Amato
8. Sarvapali D. Ramchurn

Citations in the corpus

• Decentralised coordination of low-power embedded devices using the max-sum algorithm (2008, methodology): “Furthermore, while the approximate algorithms iteratively exchange messages of small size, DPOP propagates ever larger messages up the pseudo-tree.”
• Bounded approximate decentralised coordination via the max-sum algorithm (2009, methodology): “Such techniques can be broadly divided into complete algorithms that generate optimal solutions such as ADOPT [3], OptAPO [4], and DPOP [5]; and approximate algorithms such as the Distributed Stochastic Algorithm (DSA) [1] and Maximum Gain Message [6].”