The University of Southampton
University of Southampton Institutional Repository

Benchmarking hybrid algorithms for distributed constraint optimisation games

Benchmarking hybrid algorithms for distributed constraint optimisation games
Benchmarking hybrid algorithms for distributed constraint optimisation games
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.
385-414
Chapman, Archie
2eac6920-2aff-49ab-8d8e-a0ea3e39ba60
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Chapman, Archie
2eac6920-2aff-49ab-8d8e-a0ea3e39ba60
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30

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.

Record type: Article

Abstract

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.

Text
fulltext.pdf - Version of Record
Download (404kB)

More information

Published date: 2011
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 270982
URI: https://eprints.soton.ac.uk/id/eprint/270982
PURE UUID: 56cc0ffb-f0fa-4bcf-a78b-18e1ef256348

Catalogue record

Date deposited: 05 May 2010 07:01
Last modified: 19 Jul 2019 22:14

Export record

Contributors

Author: Archie Chapman
Author: Alex Rogers
Author: Nick Jennings

University divisions

Download statistics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×