DeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 566-571.
Abstract
This paper presents a new DCOP algorithm calledDeQED (Decomposition with Quadratic Encoding to Decentralize). DeQED is based on the Divide-and-Coordinate (DaC) framework, where the agents repeatedly solve their updated local subproblems (the divide stage) and exchange coordination information that causes them to update their local sub-problems (the coordinate stage). Unlike other DaC-based DCOP algorithms, DeQED does not essentially increase the complexity of local subproblems and allows agents to avoid exchanging (primal) variable values in the coordinate stage. Our experimental results show that DeQED significantly outperformed other incomplete DCOP algorithms for both random and structured instances.
@inproceedings{ijcai2013p91,
title = {DeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP},
author = {Hatano, Daisuke and Hirayama, Katsutoshi},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {566--571},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/91},
}
TY - CPAPER TI - DeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP AU - Hatano, Daisuke AU - Hirayama, Katsutoshi T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 566 EP - 571 UR - https://ijcai.org/proceedings/2013/91 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
