# Coalition Structure Generation with Worst Case Guarantees

@article{Sandholm1999CoalitionSG, title={Coalition Structure Generation with Worst Case Guarantees}, author={Tuomas Sandholm and K. Larson and Martin Andersson and Onn Shehory and Fernando A. Tohm{\'e}}, journal={Artif. Intell.}, year={1999}, volume={111}, pages={209-238} }

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…

## 753 Citations

Coalition structure generation with worst case guarantees based on cardinality structure

- Computer ScienceAAMAS '07
- 2007

This paper reports on a novel anytime algorithm based on cardinality structure that only have to take a step further to search those coalition structures whose Cardinality structure is in the CCS(n, b).

Coalition structure generation with given required bound based on coalition combination

- Computer Science, Engineering2008 3rd International Conference on Intelligent System and Knowledge Engineering
- 2008

The relations among coalition structures in depth are analyzed in depth and a novel algorithm based on coalition combination is presented: the bound K(n)¿2 can be attained with searching of those coalition structures whose cardinality structure is in the coalition combination set CCs(n, k) .

Minimum Search to Establish Worst-Case Guarantees in Coalition Structure Generation

- Engineering, Computer ScienceIJCAI
- 2011

Coalition formation is a fundamental research topic
in multi-agent systems. In this context, while it
is desirable to generate a coalition structure that
maximizes the sum of the values of the…

Coalition Structure Generation with Given Required Bound Based on Cardinality Structure

- Mathematics2007 International Conference on Machine Learning and Cybernetics
- 2007

Coalition formation is a key topic in multi-agent 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…

A coalition structure generation algorithm based on partition cardinality structure

- Mathematics2010 IEEE International Conference on Intelligent Computing and Intelligent Systems
- 2010

Coalition formation is a key topic on multi-agent systems. As the number of coalition structures is large, it is not allowed to search the whole coalition structure tree exhaustively. So, a partial…

A Bottom-Up Search Algorithm for Dynamic Reformation of Agent Coalitions under Coalition Size Constraints

- Computer Science2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)
- 2013

This work proposes a branch and bound based algorithm called bottom Up CSG Search that searches for the optimal partitions or coalition structures among the nodes of CSG while pruning nodes that are not going to lead to the optimal coalition structure.

A Distributed Branch-and-Bound Algorithm for Computing Optimal Coalition Structures

- Computer ScienceSETN
- 2006

It is shown that the proposed distributed branch-and-bound algorithm for computing optimal coalition structures in linear production domain outperforms exhaustive search in generating optimal coalition structure in terms of elapses time and number of coalition structures generated.

Generating coalition structures with finite bound from the optimal guarantees

- Computer ScienceProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004.
- 2004

This paper reports on a novel anytime algorithm for coalition structure generation that produces solutions that are within a finite bound from the optimal, and is shown to be up to 10^379 times faster (for systems containing 1000 agents) when small bounds fromThe optimal are desirable.

Anytime coalition structure generation: an average case study

- Computer ScienceJ. Exp. Theor. Artif. Intell.
- 2000

It is shown that, in the average case, all three algorithms do much better than the recently established theoretical worst case results in Sandholm et al. (1999a), and that no one algorithm is dominant.

Near-Optimal Anytime Coalition Structure Generation

- Computer ScienceIJCAI
- 2006

A novel, anytime algorithm for coalition structure generation that is faster than previous anytime algorithms designed for this purpose and can generate solutions that either have a tight bound from the optimal or are optimal (depending on the objective).

## References

SHOWING 1-10 OF 69 REFERENCES

Anytime Coalition Structure Generation with Worst Case Guarantees

- Computer ScienceAAAI/IAAI
- 1998

This work presents an algorithm that establishes a tight bound within this minimal amount of search, and shows how to distribute the desired search across self-interested manipulative agents.

Anytime coalition structure generation: an average case study

- Computer ScienceAGENTS '99
- 1999

It is shown that, in the average case, all three algorithms do much better than the recently established theoretical worst case results in Sandholm et al. (1999a), and no one algorithm is dom inant.

Coalition Formation among Bounded Rational Agents

- Mathematics, Computer ScienceIJCAI
- 1995

This paper analyzes coalitions among self-interested agents that need to solve combinatorial optimization problems to operate efficiently in the world and finds the optimal coalition structure and its stability are significantly affected by the agents'' algorithms'' performance profiles and the unit cost of computation.

Coalitions Among Computationally Bounded Agents

- Mathematics, Computer ScienceArtif. Intell.
- 1997

A normative, application- and protocol-independent theory of coalitions among bounded-rational agents is devised, and the optimal coalition structure and its stability are significantly affected by the agents' algorithms' performance profiles and the cost of computation.

Methods for Task Allocation via Agent Coalition Formation

- Computer ScienceArtif. Intell.
- 1998

This paper presents several solutions to the problem of task allocation among autonomous agents, and suggests that the agents form coalitions in order to perform tasks or improve the efficiency of their performance.

The Nakamura Theorem for coalition structures of quota games

- Mathematics
- 1996

AbstractThis paper considers a model of society
$$S$$
with a finite number of individuals,n, a finite set off alternatives, Ω effective coalitions that must contain ana priori given numberq of…

Coalition Formation Processes with Belief Revision among Bounded-rational Self-interested Agents

- Mathematics, Computer ScienceJ. Log. Comput.
- 1999

It is shown that -core stability reduces to analyzing whether some utility pro le is maximal for all agents, which carries the -core-based stability results directly over to two other strategic solution concepts: Nash equilibrium and Coalition-Proof Nash equilibrium.

Task Allocation Via Coalition Formation Among Autonomous Agents

- Computer ScienceIJCAI
- 1995

This paper gives an efficient solution to the problem of task allocation among autonomous agents, and suggests that the agents will form coalitions in order to perform tasks or improve the efficiency.

Coalition, Cryptography, and Stability: Mechanisms for Coalition Formation in Task Oriented Domains

- Computer ScienceAAAI
- 1994

A simple coalition formation mechanism that uses cryptographic techniques for subadditive Task Oriented Domains that is efficient, symmetric, and individual rational and satisfies coalition rationality.

Negotiation among self-interested computationally limited agents

- Computer Science
- 1996

This dissertation analyses negotiations among agents that try to maximize payoff without concern of the global good, where computational limitations restrict each agent's rationality: in combinatorial negotiation domains computational complexity precludes enumerating and evaluating all possible outcomes.