|
|
|
|
RI | Publications | Coalition Structure Generation with Worst Case Guarantees
|
|
Text only version of this site
Coalition Structure Generation with Worst Case Guarantees
T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohme
Artificial Intelligence, 1999.
Jump to: Download | Abstract | Text Reference | BibTeX Reference
| Download [Help] |
Adobe portable document format (pdf) [301 KB] Compressed postscript (ps.gz) [102 KB]
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
| Abstract |
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, finding the optimal coalition structure is NP-complete. But then, can the coalition structure found via a partial search be guaranteed to be within a bound from optimum?
We show that none of the previous coalition structure generation algorithms can establish any bound because they search fewer nodes than a threshold that we show necessary for establishing a bound. We present an algorithm that establishes a tight bound within this minimal amount of search, and show that any other algorithm would have to search strictly more. The fraction of nodes needed to be searched approaches zero as the number of agents grows.
If additional time remains, our anytime algorithm searches further, and establishes a progressively lower tight bound. Surprisingly, just searching one more node drops the bound in half. As desired, our algorithm lowers the bound rapidly early on, and exhibits diminishing returns to computation. It also significantly outperforms its obvious contenders. Finally, we show how to distribute the desired search across self-interested manipulative agents.
| Text Reference |
T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohme, "Coalition Structure Generation with Worst Case Guarantees," Artificial Intelligence, 1999.
| BibTeX Reference |
@article{Sandholm_1999_2123,
author = "Tuomas Sandholm and Kate Larson and Martin Andersson and Onn Shehory and Fernando Tohme",
title = "Coalition Structure Generation with Worst Case Guarantees",
journal = "Artificial Intelligence",
year = "1999"
}