Evolutionary Game Network Reconstruction by Memetic Algorithm with l1/2 Regularization
Evolutionary Game (EG) theory is effective approach to understand and analyze the widespread cooperative behaviors among individuals. Reconstructing EG networks is fundamental to understand and control its collective dynamics. Most existing approaches extend this problem to the l 1-regularization optimization problem, leading to suboptimal solutions. In this paper, a memetic algorithm (MA) is proposed to address this network reconstruction problem with l 1/2 regularization. The problem-specific initialization operator and local search operator are integrated into MA to accelerate the convergence. We apply the method to evolutionary games taking place in synthetic and real networks, finding that our approach has competitive performance to eight state-of-the-art methods in terms of effectiveness and efficiency.
KeywordsCompressed sensing Network reconstruction Memetic algorithm Evolutionary games Sparse reconstruction
This work is partially supported by the Outstanding Young Scholar Program of National Natural Science Foundation of China (NSFC) under Grant 61522311, the Overseas, Hong Kong & Macao Scholars Collaborated Research Program of NSFC under Grant 61528205, and the Key Program of Fundamental Research Project of Natural Science of Shaanxi Province, China under Grant 2017JZ017.
- 2.Wang, W.X., Lai, Y.C., Grebogi, C., Ye, J.: Network reconstruction based on evolutionary-game data via compressive sensing. Phys. Rev. X 1, 021021 (2011)Google Scholar
- 4.Moscato, P.: On evolution, search, optimization, genetic algorithms and martialarts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Rep., 826 (1989)Google Scholar
- 7.Herrity, K.K., Gilbert, A.C., Tropp, J.A.: Sparse approximation via iterative thresholding. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 624–627 (2006)Google Scholar
- 13.Eshellman, L.J.: Real-coded genetic algorithms and interval-schemata. Found. Genetic Algorithms 2, 187–202 (1993)Google Scholar
- 14.Neubauer, A.: A theoretical analysis of the non-uniform mutation operator for the modified genetic algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 93–96 (1997)Google Scholar
- 24.Malioutov, D.M., Cetin, M., Willsky, A.S.: Homotopy continuation for sparse signal representation. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 733–736 (2005)Google Scholar
- 31.Krebs, V.: http://www.orgnet.com/divided.html