Design of hypergraph-based multiagent systems under random attacks

Designing and partitioning hyperedges problem for agents under hypergraph is analysed. Optimisation problems where a defender attempts to connect the hypergraph under certain hyperedges' costs where agents have certain dynamics are considered. Different costs under different hyperedges length and its effect on the hypergraph and agents' states are analysed. Such relationships are discussed in several numerical examples, where the agents achieve their goals faster if they prioritise certain aspects of the utility functions related to the dynamics. Furthermore, the robustness of the network under random attacks is discussed, where the systems with higher discount factors are more robust and have better performances.