Static and dynamic coalition formation in group-choice decision making

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In Group-Choice Decision Making (GCDM) where a number of stakeholders are involved in choosing a single solution from a set of available solution options, it is common for the stakeholders to form coalition during negotiation in order to increase their individual welfare. It is also common to use Multi-Agent Systems (MAS) to automate GCDM processes. In such MAS, agents have to form coalitions like their human counterparts, and within each coalition, the individual agents behave according to the strategies of their clients. This paper presents a coalition formation engine that has two coalition formation algorithms. One of the algorithms is based on the concept of static coalition formation, and the other is based on the concept of dynamic coalition formation. Moreover, the coalition formation engine is coupled with algorithms that govern the social behavior of the agents in their coalitions, to form an agent negotiation engine. Finally, this paper presents an example and simulation results that illustrate the operational effectiveness of the two coalition formation algorithms, as well as the algorithms that govern the social behavior of the agents. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wanyama, T. (2007). Static and dynamic coalition formation in group-choice decision making. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4617 LNAI, pp. 45–56). Springer Verlag. https://doi.org/10.1007/978-3-540-73729-2_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free