The search for the universal concept of complexity and a general optimality condition of cooperative agents
chapter
posted on 2017-12-06, 00:00authored byVictor Korotkikh
There are many different notions of complexity. However, complexity does not have a generally accepted universal concept. It is becoming more clear that the search for the universal concept must be done within a final theory. In this chapter a concept of structural complexity for the first time suggests the real opportunity to search the universal concept of complexity within a final theory. Experimental facts given in this chapter allow to suggest a general optimality condition of cooperative agents in terms of structural complexity. The optimality condition says that cooperative agents show their best performance for a particular problem when their structural complexity equals the structural complexity of the problem. According to the optimality condition to control a complex system efficiently means to equate its structural complexity with the structural complexity of the problem.
Funding
Category 1 - Australian Competitive Grants (this includes ARC, NHMRC)
History
Editor
Butenko S; Murphey R; Pardalos PM
Start Page
129
End Page
163
Number of Pages
35
ISBN-10
1402010826
Publisher
Kluwer
Place of Publication
Dordrecht, Netherlands
Open Access
No
External Author Affiliations
Faculty of Informatics and Communication;
Era Eligible
Yes
Parent Title
Cooperative control : models, applications, and algorithms