Informatics and Applications

2025, Volume 19, Issue 1, pp 9-15

ON GAME NETWORKS STRUCTURE OPTIMIZATION IN MULTIAGENT SYSTEMS

  • N. S. Vasilyev

Abstract

Monoidal category of binary relations is applied to study and optimize large multiagent systems. Agents' communication networks structure choice is essential part of players' strategies. It must be selected to resolve the conflict of interests. Compositionality of the problem in the monoidal category gives possibility to solve it. Notion of the optimal game networks structure is contributed. The definition is based on equilibria and effectiveness principles usage. A method is proposed to find the optimal structure. It uses families of binary relations to compare given agents' preferences relations. Players' optimal communication structure is built by means of the most expedient players' coalitions search. Matrix algebra presentation of binary relations allows computing it. On the ground of the method, a new technology to study and optimize large multiagent systems can be built. Its program realization is supported by computer category algebra.

[+] References (18)

[+] About this article