Benchmarking hybrid algorithms for distributed constraint optimisation games

Chapman, Archie, Rogers, Alex and Jennings, Nick (2011) Benchmarking hybrid algorithms for distributed constraint optimisation games. Journal of Autonomous Agents and Multi-Agent Systems, 22, (3), 385-414.


[img] PDF - Version of Record
Download (395Kb)


In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose eight DCOP algorithms, taken from the game theory and computer science literatures, into their salient components. We then use these components to construct three novel hybrid algorithms. Finally, we empirical evaluate all eleven algorithms, in terms of solution quality, timeliness and communication resources used, in a series of graph colouring experiments. Our experimental results show the existence of several performance trade-offs (such as quick convergence to a solution, but with a cost of high communication needs), which may be exploited by a system designer to tailor a DCOP algorithm to suit their mix of requirements.

Item Type: Article
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 270982
Accepted Date and Publication Date:
Date Deposited: 05 May 2010 07:01
Last Modified: 31 Mar 2016 14:17
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics