Abstract
This paper is concerned with the development of a novel approach to solve expensive optimisation problems. The approach relies on game theory and a multi-agent framework in which a number of existing algorithms, cast as agents, are deployed with the aim to solve the problem in hand as efficiently as possible. The key factor for the success of this approach is a dynamic resource allocation biased toward promising algorithms on the given problem. This is achieved by allowing the agents to play a cooperative-competitive game the outcomes of which will be used to decide which algorithms, if any, will drop out of the list of solver-agents and which will remain in use. A successful implementation of this framework will result in the most suited algorithm(s) for the given problem being predominantly used on the available computing platform. In other words it guarantees the best use of the resources both algorithms and hardware with the by-product being the best approximate solution for the problem given the available resources. GTMAS is tested on a standard collection of TSP problems. The results are included.
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
Aldea, A., Alcantra, R.B., Jimenez, L., Moreno, A., Martinez, J., Riano, D.: The scope of application of multi-agent systems in the process industry: Three case studies. Expert Systems with Applications 26, 39–47 (2004)
Axelrod, R.: Effective choice in the prisoner’s dilemma. Journal of Conflict Resolution 24(1), 3–25 (1980)
Axelrod, R.: More effective choice in the prisoner’s dilemma. Journal of Conflict Resolution 24(3), 379–403 (1980)
Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)
Axelrod, R.: The evolution of strategies in the iterated prisoners’ dilemma. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 32–42. Morgan Kaufmann, Los Altos (1987)
Axelrod, R., Hamilton, W.D.: The evolution of cooperation. Science 211, 1390–1396 (1981)
Binmore, K.: Fun and Games. D.C.Heath, Lexington (1991)
Binmore, K.: Playing fair: Game theory and the social contract. MIT Press, Cambridge (1994)
Bratman, M.E.: Shared cooperative activity. The Philosophical Review 101(2), 327–341 (1992)
Byrd, R.H., Dert, C.L., Rinnooy Kan, A.H.G., Schnabel, R.B.: Concurrent stochastic methods for global optimization. Mathematical Programming 46, 1–30 (1990)
Colman, A.M.: Game Theory and Experimental Games. Pergamon Press Ltd., Oxford (1982)
Doran, J.E., Franklin, S., Jennings, N.R., Norman, T.J.: On cooperation in multi-agent systems. The Knowledge Engineering Review 12(3), 309–314 (1997)
Nash, J.F.: Non-cooperative games. Annals of Mathematics 54(2), 286–295 (1951)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Linster, B.: Essays on Cooperation and Competition. PhD thesis, University of Michigan, Michigan (1990)
Luce, R., Raiffa, H.: Games and Decisions. Wiley, New York (1957)
Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming 39, 117–130 (1987)
Töreyen, Ö.: A game-theory based multi-agent system for solving complex optimisation problems and a clustering application related to the integration of turkey into the eu community. M.Sc. Thesis Submitted to the Department of Mathematical Sciences, University of Essex, UK (2008)
Park, S., Sugumaran, V.: Designing multi-agent systems: A framework and application. Expert Systems with Applications 28, 259–271 (2005)
Rapoport, A., Chammah, A.M.: Prisoner’s Dilemma: A Study in Conflict and Cooperation. University of Michigan Press, Ann Arbor (1965)
Reinelt, G.: TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95
Rinnooy Kan, A.H.G., Timmer, G.T.: Stochastic global optimization methods Part I: Clustering methods. Mathematical Programming 39, 27–56 (1987)
Rinnooy Kan, A.H.G., Timmer, G.T.: Stochastic global optimization methods Part II: Multi-level methods. Mathematical Programming 39, 57–78 (1987)
Rinnooy Kan, A.H.G., Timmer, G.T.: Global optimization. In: Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds.) Optimization. Handbooks in Operations Research and Management Science, ch. IX, vol. 1, pp. 631–662. North Holland, Amsterdam (1989)
Salhi, A., Glaser, H., De Roure, D.: A genetic approach to understanding cooperative behaviour. In: Osmera, P. (ed.) Proceedings of the 2nd International Mendel Conference on Genetic Algorithms, MENDEL 1996, pp. 129–136 (1996)
Salhi, A., Glaser, H., De Roure, D.: Parallel implementation of a genetic-programming based tool for symbolic regression. Information Processing Letters 66(6), 299–307 (1998)
Salhi, A., Glaser, H., De Roure, D., Putney, J.: The prisoners’ dilemma revisited. Technical Report DSSE-TR-96-2, Department of Electronics and Computer Science, The University of Southampton, U.K. (February 1996)
Salhi, A., Proll, L.G., Rios Insua, D., Martin, J.: Experiences with stochastic algorithms for a class of global optimisation problems. RAIRO Operations Research 34(22), 183–197 (2000)
Seshadri, A.: Simulated annealing for travelling salesman problem, http://www.mathworks.com/matlabcentral/fileexchange
Tweedale, J., Ichalkaranje, H., Sioutis, C., Jarvis, B., Consoli, A., Phillips-Wren, G.: Innovations in multi-agent systems. Journal of Network and Computer Applications 30, 1089–1115 (2007)
Wooldridge, M., Jennings, N.R.: Intelligent agents: Theory and practice. Knowledge Engineering Review 10(2), 115–152 (1995)
Zhigljavsky, A.A.: Theory of Global Search. Mathematics and its applications, Soviet Series, vol. 65. Kluwer Academic Publishers, Dordrecht (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Salhi, A., Töreyen, Ö. (2010). A Game Theory-Based Multi-Agent System for Expensive Optimisation Problems. In: Tenne, Y., Goh, CK. (eds) Computational Intelligence in Optimization. Adaptation, Learning, and Optimization, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12775-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-12775-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12774-8
Online ISBN: 978-3-642-12775-5
eBook Packages: EngineeringEngineering (R0)