Informatics and Applications

2026, Volume 20, Issue 1, pp 73-82

ON RELATIONAL FORM TO SOLVE THE NETWORKING COOPERATIVE GAMES

  • N. S. Vasilyev

Abstract

Relational statement of networking game is investigated. It has applications to multiagent and cooperative robotics problems. A model with a large number of intellectual players capable of cooperative behavior is studied. The conflict rational resolution is based on the agents networking and data transition. The networking structure is generated by agents themselves in the process of stable coalitions formation. To achieve this goal, players apply generalization of their preferences and possibilities relations. For equilibrium situation and optimal communication network search, game reduction is used. It is based on the game compositionality property in the category of binary relations. The distributed polynomial method to solve the networking cooperative game is contributed. Effective or stable parallel coalitions are to be found in it by players' collective efforts. Possibility to split all players into union of stable coalitions is proved. Parallel coalitions classification is given depending on the degree of their stability.

[+] References (17)

[+] About this article