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 componen...
Main Authors: | Chapman, Archie (Author), Rogers, Alex (Author), Jennings, Nick (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2011.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
A Unifying Framework for Iterative Approximate Best-Response Algorithms for Distributed Constraint Optimisation Problems
by: Chapman, Archie, et al.
Published: (2011) -
Learning in unknown reward games: application to sensor networks
by: Chapman, Archie C., et al.
Published: (2014) -
Hybrid algorithms for distributed constraint satisfaction
by: Lee, David Alexander James
Published: (2010) -
Decentralised Dynamic Task Allocation Using Overlapping Potential Games
by: Chapman, Archie, et al.
Published: (2010) -
Control of large distributed systems using games with pure strategy Nash equilibria
by: Chapman, Archie C.
Published: (2009)