Distributed constraint optimization problems (DCOPs) are a model for representing multi-agent systems in which agents cooperate to optimize a global objective. The DCOP model has two main advantages: it can represent a wide range of problem domains, and it supports the development of generic algorithms to solve them. Firstly, this paper presents some advances in both complete and approximate DCOP algorithms. Secondly, it explains that the DCOP model makes a number of unrealistic assumptions that severely limit its range of application. Finally, it points out hints on how to tackle such limitations.
Links:
[1] http://www.iiia.csic.es/en/individual/marc-pujol-gonzalez
[2] http://ijcai.org/papers11/contents.php
[3] http://www.iiia.csic.es/en/publications/export/tagged/4341
[4] http://www.iiia.csic.es/en/publications/export/xml/4341
[5] http://www.iiia.csic.es/en/publications/export/bib/4341
[6] http://www.iiia.csic.es/en/project/at
[7] http://www.iiia.csic.es/en/project/eve
[8] http://www.iiia.csic.es/en/project/recedit