More Like this

1. A games-in-games approach to mosaic command and control design of dynamic network-of-networks for secure and resilient multi-domain operations

   https://doi.org/10.1117/12.2526677  

   Chen, Juntao ; Zhu, Quanyan ( July 2019 , Proceedings Volume 11017, Sensors and Systems for Space Applications XII; 110170P (2019))
2. A game-theoretic framework for autonomous vehicles velocity control: Bridging microscopic differential games and macroscopic mean field games

   https://doi.org/10.3934/dcdsb.2020131  

   Huang, Kuang ; Di, Xuan ; Du, Qiang ; Chen, Xi ( January 2017 , Discrete & Continuous Dynamical Systems - B)
3. Measurement in learning games evolution: Review of methodologies used in determining effectiveness of Math Snacks games and animations

   Trujillo, K. ; Chamberlin, B. ; Wiburg, K. ; Armstrong, A. ( January 2016 , Technology, knowledge and learning)
4. Interdependent Network Recovery Games: Interdependent Network Recovery Games

   https://doi.org/10.1111/risa.12923  

   Smith, Andrew M. ; González, Andrés D. ; Dueñas-Osorio, Leonardo ; D'Souza, Raissa M. ( October 2017 , Risk Analysis)
5. Multi-scale games: Representing and solving games on networks with group structure

   Jin, Kun ; Vorobeychik, Yevgeniy ; Liu, Mingyan ( January 2021 , Proceedings of the AAAI Conference on Artificial Intelligence)

   Network games provide a natural machinery to compactly represent strategic interactions among agents whose payoffs exhibit sparsity in their dependence on the actions of others. Besides encoding interaction sparsity, however, real networks often exhibit a multi-scale structure, in which agents can be grouped into communities, those communities further grouped, and so on, and where interactions among such groups may also exhibit sparsity. We present a general model of multi-scale network games that encodes such multi-level structure. We then develop several algorithmic approaches that leverage this multi-scale structure, and derive sufficient conditions for convergence of these to a Nash equilibrium. Ourmore »numerical experiments demonstrate that the proposed approaches enable orders of magnitude improvements in scalability when computing Nash equilibria in such games. For example, we can solve previously intractable instances involving up to 1 million agents in under 15 minutes.« less