The University of Southampton
University of Southampton Institutional Repository

A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games

A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games
A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games
This paper introduces a parameterisation of learning algorithms for distributed constraint optimisation problems (DCOPs). This parameterisation encompasses many algorithms developed in both the computer science and game theory literatures. It is built on our insight that when formulated as noncooperative games, DCOPs form a subset of the class of potential games. This result allows us to prove convergence properties of algorithms developed in the computer science literature using game theoretic methods. Furthermore, our parameterisation can assist system designers by making the pros and cons of, and the synergies between, the various DCOP algorithm components clear.
99-113
Chapman, Archie
2eac6920-2aff-49ab-8d8e-a0ea3e39ba60
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, N.R
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Chapman, Archie
2eac6920-2aff-49ab-8d8e-a0ea3e39ba60
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, N.R
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Chapman, Archie, Rogers, Alex and Jennings, N.R (2008) A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games. Tenth International Workshop on Distributed Constraint Reasoning (DCR '08), Portugal. pp. 99-113 .

Record type: Conference or Workshop Item (Paper)

Abstract

This paper introduces a parameterisation of learning algorithms for distributed constraint optimisation problems (DCOPs). This parameterisation encompasses many algorithms developed in both the computer science and game theory literatures. It is built on our insight that when formulated as noncooperative games, DCOPs form a subset of the class of potential games. This result allows us to prove convergence properties of algorithms developed in the computer science literature using game theoretic methods. Furthermore, our parameterisation can assist system designers by making the pros and cons of, and the synergies between, the various DCOP algorithm components clear.

PDF
aamas08DCR.pdf - Other
Download (211kB)

More information

Published date: May 2008
Venue - Dates: Tenth International Workshop on Distributed Constraint Reasoning (DCR '08), Portugal, 2008-05-01
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 265208
URI: https://eprints.soton.ac.uk/id/eprint/265208
PURE UUID: 9eee21ba-d0e2-4777-8cfa-bc405ea3cc92

Catalogue record

Date deposited: 12 Mar 2008 16:29
Last modified: 18 Jul 2017 07:28

Export record

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.

×