Abstract
A collection of many systems that cooperatively solve an optimization problem is considered. The consideration aims to determine criteria such that the systems as a whole show their best performance for the problem. A general framework based on a concept of structural complexity is proposed to determine the criteria. The main merit of this framework is that it allows to set up computational experiments revealing the criteria. In particular, the experiments give evidence to suggest that criteria of best performance are realized when the structural complexity of cooperative systems equals the structural complexity of the optimization problem. The results of the paper could give a new perspective in the developing of optimization methods based on cooperative systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Axelrod, (1984), The Evolution of Cooperation, Basic Books, New York.
M. Mezard, G. Parisi and M.A. Virasoro (1987), Spin Glass Theory and Beyond, World Scientific, Singapore.
B. Huberman, (1990), The Performance of Cooperative Processes, Physica D, vol. 42, pp. 39–47.
J. Holland, (1998), Emergence: From Chaos to Order, Perseus Books, Massachusetts.
E. Bonabeau, M. Dorigo and G. Theraulaz, (1999), Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, Oxford.
V. Korotkich, (1999), A Mathematical Structure for Emergent Computation, Kluwer Academic Publishers, Dordrecht/Boston/London.
V. Korotkich, (1995), Multicriteria Analysis in Problem Solving and Structural Complexity, in Advances in Multicriteria Analysis, edited by P. Pardalos, Y. Siskos and C. Zopounidis, Kluwer Academic Publishers, Dordrecht, pp. 81–90.
E. Prouhet, (1851), Memoire sur Quelques Relations entre les Puissances des Nombres, C.R. Acad. Sci., Paris, vol. 33, p. 225.
A. Thue, (1906), Uber unendliche Zeichenreihen, Norske vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana, vol. 7, p. 1.
M. Morse, (1921), Recurrent Geodesics on a Surface of Negative Curvature, Trans. Amer. Math. Soc., vol. 22, p. 84.
S. Weinberg, (1993), Dreams of a Final Theory, Vintage, London.
R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, (1999), Determining Computational Complexity from Characteristic ‘Phase Transitions’ Nature, vol. 400, pp. 133–137.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Korotkich, V. (2002). On A General Framework To Study Cooperative Systems. In: Murphey, R., Pardalos, P.M. (eds) Cooperative Control and Optimization. Applied Optimization, vol 66. Springer, Boston, MA. https://doi.org/10.1007/0-306-47536-7_7
Download citation
DOI: https://doi.org/10.1007/0-306-47536-7_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-0549-7
Online ISBN: 978-0-306-47536-8
eBook Packages: Springer Book Archive