Asynchronous algorithms for approximate distributed constraint optimization with quality bounds

@inproceedings{Kiekintveld2010AsynchronousAF,
  title={Asynchronous algorithms for approximate distributed constraint optimization with quality bounds},
  author={Christopher Kiekintveld and Zhengyu Yin and Atul Kumar and Milind Tambe},
  booktitle={AAMAS},
  year={2010}
}
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing fast incomplete solution algorithms for large-scale applications. One of the few incomplete algorithms to provide bounds on solution quality is k-size optimality, which defines a local optimality criterion based on the size of the group of deviating agents. Unfortunately, the lack of a general-purpose algorithm and the… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

62 Citations

01020'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

References

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

Bounded approximate decentralised coordination using the max-sum algorithm

A. Farinelli, A. Rogers, N. Jennings
In DCR, • 2009
View 4 Excerpts
Highly Influenced

Distributed coordination through anarchic optimization

S. Fitzpatrick, L. Meertens
Distributed Sensor Networks: A Multiagent Perspective. Kluwer, • 2003
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…