A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games ?

@inproceedings{Chapman2008APO,
  title={A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games ?},
  author={Archie C. Chapman and Alex Rogers and Nicholas R. Jennings},
  year={2008}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Distributed coordination through anarchic optimization

S. Fitzpatrick, L. Meertens
In Lesser, V., Jr., C.L.O., Tambe, M., eds.: Distributed Sensor Networks: A Multiagent Perspective. Kluwer Academic Publishers • 2003
View 12 Excerpts
Highly Influenced

Distributed simulated annealing and comparison to DSA

M. Arshad, M. C. Silaghi
Proceedings of the Fourth International Workshop on Distributed Constraint Reasoning (DCR ’03), Acapulco, Mexico • 2003
View 4 Excerpts
Highly Influenced

Potential games

D. Monderer, L. S. Shapley
Games and Economic Behavior 14 • 1996
View 3 Excerpts
Highly Influenced

Brown's original fictitious play

J. Economic Theory • 2007
View 2 Excerpts

Similar Papers

Loading similar papers…