Abstract
The paper presents a novel method for Coalition Formation Problem (CFP). The main requirements of the method are: the acceptable solution should be achieved in the constrained, acceptable time; the solution should be obtained with a worst case guarantees. The Sandholm Algorithm (SanA) can give the optimal solution, but it requires unacceptable time. On the other hand, heuristic approach, e.g., Evolutionary Algorithm (EA), can be able to give a quite good solution, but we do not know how far it is from the optimum. We propose a hybrid approach (SanEv) in which firstly, the Sandholm Algorithm is ran to achieve a solution on a given quality level, next we run an Evolutionary Algorithm. The paper presents our method and performed experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wooldridge, M., Jennings, N.R.: Intelligent Agents: Theory and Practice. Knowledge Engineering Review 10, 115–152 (1995)
Horling, B., Lesser, V.: A Survey of Multi-Agent Organizational Paradigms. The Knowledge Engineering Review 19(4), 281–316 (2005)
Rahwan, T.: Algorithms for Coalition Formation in Multi-Agent Systems. PhD thesis, University of Southampton (2007)
Shehory, O., Kraus, S.: Task allocation via coalition formation among autonomous agents. In: Proc. 14th Int. Joint Conf. on Artificial Intelligence, pp. 655–661 (1995)
Shehory, O., Kraus, S.: Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents. In: Proc. of the 2nd Intern. Conf. on Multiagent Systems (ICMAS 1996), pp. 330–337 (1996)
Shehory, O., Kraus, S.: Methods for Task Allocation Via Agent Coalition Formation. Artificial Intelligence 101(1-2), 165–200 (1998)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. The MIT Press, USA (2001)
Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally Manageable Combinatorial Auctions. Management Science 44(8), 1131–1147 (1995)
Jiangan, Y., Zhenghu, L.: Coalition formation mechanism in multi-agent systems based on genetic algorithms. Applied Soft Computing 7(2), 561–568 (2006)
Sandip, S., Ip, S., Partha, S.D.: Searching for Optimal Coalition Structures. In: Proc. of the Fourth Intern. Conf. on Multiagent Systems, pp. 286–292. IEEE, Los Alamitos (2000)
Dang, V.D., Jennings, N.R.: Generating Coalition Structures with Finite Bound from the Optimal Guarantees. In: AAMAS 2004 Proc. of the Third Intern. Joint Conf. on Autonomous Agents and Multiagent Systems, pp. 564–571. IEEE Comp. Soc., Los Alamitos (2004)
Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohme, F.: Coalition Structure Generation with Worst Case Guarantees. Artificial Intelligence 111(1-2), 209–238 (1999)
Gruszczyk, W.: Coalition formation problem in time-constrained multi-agent environments (in Polish). Master Thesis, Wroclaw Univ. of Technology, Poland (2009)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Program. Springer, Berlin (1999)
Gruszczyk, W., Kwasnicka, H.: In: Ganzha, M., et al. (eds.) Proc. of the Int. Multiconf. on Comp. Science and Information Technology, Poland, pp. 125–130 (2008)
Straffin, P.D.: Game Theory and Strategy. Mathematical Assoc. of America (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwasnicka, H., Gruszczyk, W. (2010). Coalition Formation Using Combined Deterministic and Evolutionary Approach. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12145-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-12145-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12144-9
Online ISBN: 978-3-642-12145-6
eBook Packages: Computer ScienceComputer Science (R0)