Chapman, A., Rogers, A. and Jennings, N. R. (2008) A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games. In: Tenth International Workshop on Distributed Constraint Reasoning (DCR '08), Estoril, Portugal. pp. 99-113.
Download
![[img]](http://eprints.ecs.soton.ac.uk/style/images/fileicons/application_pdf.png)
|
PDF
206Kb |
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.
| Item Type: | Conference or Workshop Item | ||||||
|---|---|---|---|---|---|---|---|
| Creator/Authors: |
| ||||||
| Research Group: | Old ECS Groups > Intelligence, Agents, Multimedia Current ECS Groups > Agents, Interaction and Complexity | ||||||
| Date: | May 2008 | ||||||
| Information about this record: | |||||||
| Citations: | Google Scholar: 6 | ||||||
| Downloads (2010): | 47 | ||||||
| ID Code: | 15208 | ||||||
| Last Modified: | 23 Sep 2011 10:36 | ||||||
| Deposited On: | 12 Mar 2008 16:29 by Chapman, Archie | ||||||
Tools & Metadata
Download Statistics
Members of ECS may view the download statistics dashboard for this record.
Corrections
ECS staff and postgraduates may modify this record
