Game-based coalescence over multi-agent systems

📝 Original Info

• Title: Game-based coalescence over multi-agent systems
• ArXiv ID: 1910.02692
• Date: 2019-10-08
• Authors: Jingying Ma, Jinming Du, and Yuanshi Zheng

📝 Abstract

Coalescence, as a kind of ubiquitous group behavior in the nature and society, means that agents, companies or other substances keep consensus in states and act as a whole. This paper considers coalescence for n rational agents with distinct initial states. Considering the rationality and intellectuality of the population, the coalescing process is described by a bimatrix game which has the unique mixed strategy Nash equilibrium solution. Since the process is not an independent stochastic process, it is difficult to analyze the coalescing process. By using the first Borel-Cantelli Lemma, we prove that all agents will coalesce into one group with probability one. Moreover, the expected coalescence time is also evaluated. For the scenario where payoff functions are power functions, we obtain the distribution and expected value of coalescence time. Finally, simulation examples are provided to validate the effectiveness of the theoretical results.

📄 Full Content

Reference