Fetching the paper…
Reading the bibliography…
We propose an approach to modelling large-scale multi-agent dynamical systems allowing interactions among more than just pairs of agents using the theory of mean field games and the notion of hypergraphons, which are obtained as limits of large hypergraphs.
K. Cui and H. Koeppl, “Approximately solving mean field games via entropy-regularized deep reinforcement learning,” in International Conference on Artificial Intelligence and Statistics (PMLR, 2021) pp. 1909–1917
1917
Earlier work this paper cites.
D. Maki and M. Thompson, Mathematical Models and Applications: With EmphaSIS on the Social, Life, and Management Sciences (Prentice-Hall, 1973)
1973
Earlier work this paper cites.
M. Huang, R. P. Malhamé, and P. E. Caines, “Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle,” Communications in Information & Systems 6
2006
Earlier work this paper cites.
J.-M. Lasry and P.-L. Lions, “Mean field games,” Japanese journal of mathematics 2
2007
Earlier work this paper cites.
C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, “The complexity of computing a Nash equilibrium,” SIAM Journal on Computing 39
2009
Earlier work this paper cites.
Y. Achdou and I. Capuzzo-Dolcetta, “Mean field games: numerical methods,” SIAM Journal on Numerical Analysis 48
2010
Earlier work this paper cites.
O. Guéant, J.-M. Lasry, and P.-L. Lions, “Mean field games and applications,” in Paris-Princeton lectures on mathematical finance 2010 (Springer, 2011) pp. 205–266
2011
Earlier work this paper cites.
C. Borgs, J. Chayes, L. Lovász, V. Sós, and K. Vesztergombi, “Limits of randomly grown graph sequences,” European Journal of Combinatorics 32
2011
Earlier work this paper cites.
L. Lovász, Large networks and graph limits , Vol. 60 (American Mathematical Soc., 2012)
2012
Earlier work this paper cites.
G. Elek and B. Szegedy, “A measure-theoretic approach to the theory of dense hypergraphs,” Advances in Mathematics 231
2012
Earlier work this paper cites.
A. Bensoussan, J. Frehse, P. Yam, et al. , Mean field games and mean field type control theory , Vol. 101 (Springer, 2013)
2013
Earlier work this paper cites.
J. Arabneydi and A. Mahajan, “Team optimal control of coupled subsystems with mean-field sharing,” in 53rd IEEE Conference on Decision and Control (2014) pp. 1669–1674
2014
Earlier work this paper cites.
M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter, “Multilayer networks,” Journal of complex networks 2
2014
Earlier work this paper cites.
M. L. Puterman, Markov decision processes: discrete stochastic dynamic programming (John Wiley & Sons, 2014)
2014
Earlier work this paper cites.
A. F. Hanif, H. Tembine, M. Assaad, and D. Zeghlache, “Mean-field games for resource sharing in cloud-based networks,” IEEE/ACM Transactions on Networking 24
2015
Earlier work this paper cites.
D. Glasscock, “What is… a graphon?” Notices of the AMS 62
2015
Earlier work this paper cites.
Y. Zhao, “Hypergraph limits: a regularity approach,” Random Structures & Algorithms 47
2015
Earlier work this paper cites.
W. R. KhudaBukhsh, J. Rückert, J. Wulfheide, D. Hausheerv, and H. Koeppl, “Analysing and leveraging client heterogeneity in swarming-based live streaming,” in 2016 IFIP Networking Conference (IFIP Networking) and Workshops (2016) pp. 386–394
2016
Earlier work this paper cites.
S. Eshghi, M. H. R. Khouzani, S. Sarkar, and S. S. Venkatesh, “Optimal patching in clustered malware epidemics,” IEEE/ACM Transactions on Networking 24
2016
Earlier work this paper cites.
A. Tcheukam, B. Djehiche, and H. Tembine, “Evacuation of multi-level building: Design, control and strategic flow,” in 2016 35th Chinese Control Conference (CCC) (IEEE, 2016) pp. 9218–9223
2016
Earlier work this paper cites.
Á. Bodó, G. Y. Katona, and P. L. Simon, “SIS epidemic propagation on hypergraphs,” Bulletin of mathematical biology 78
2016
Earlier work this paper cites.
P. Cardaliaguet and S. Hadikhanloo, “Learning in mean field games: the fictitious play,” ESAIM: Control, Optimisation and Calculus of Variations 23
2017
Earlier work this paper cites.
S. Gao and P. E. Caines, “The control of arbitrary size networks of linear systems via graphon limits: An initial investigation,” in 2017 IEEE 56th Annual Conference on Decision and Control (CDC) (IEEE, 2017) pp. 1052–1057
2017
Earlier work this paper cites.
I. Z. Kiss, J. C. Miller, P. L. Simon, et al. , “Mathematics of epidemics on networks,” Cham: Springer 598
2017
Earlier work this paper cites.
H. Pham and X. Wei, “Bellman equation and viscosity solutions for mean-field stochastic control problem,” ESAIM: Control, Optimisation and Calculus of Variations 24
2018
Earlier work this paper cites.
R. Carmona, F. Delarue, et al. , Probabilistic Theory of Mean Field Games with Applications I-II (Springer, 2018)
2018
Earlier work this paper cites.
A. Aurell and B. Djehiche, “Mean-field type modeling of nonlocal crowd aversion in pedestrian crowd dynamics,” SIAM Journal on Control and Optimization 56
2018
Earlier work this paper cites.
P. E. Caines and M. Huang, “Graphon mean field games and the GMFG equations,” in 2018 IEEE Conference on Decision and Control (CDC) (IEEE, 2018) pp. 4129–4134
2018
Cited alongside, same era.
N. Saldi, T. Basar, and M. Raginsky, “Markov–Nash equilibria in mean-field games with discounted cost,” SIAM Journal on Control and Optimization 56
2018
Cited alongside, same era.
K. A. Jacobsen, M. G. Burch, J. H. Tien, and G. A. Rempała, “The large graph limit of a stochastic epidemic model on a dynamic multilayer network,” Journal of Biological Dynamics 12
2018
Cited alongside, same era.
C. Borgs, J. T. Chayes, H. Cohn, and Y. Zhao, “An l p l^{p} theory of sparse graph convergence ii: Ld convergence, quotients and right convergence,” The Annals of Probability 46
2018
Cited alongside, same era.
I. Iacopini, G. Petri, A. Barrat, and V. Latora, “Simplicial models of social contagion,” Nature communications 10
2021
Later among the works it cites.
K. Zhang, Z. Yang, and T. Başar, “Multi-agent reinforcement learning: A selective overview of theories and algorithms,” Handbook of Reinforcement Learning and Control , 321–384 (2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
Y. Lin, G. Qu, L. Huang, and A. Wierman, “Multi-agent reinforcement learning in stochastic networked systems,” Advances in Neural Information Processing Systems 34
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
G. Qu and N. Li, “Exploiting fast decaying and locality in multi-agent mdp with tree dependence structure,” in 2019 IEEE 58th conference on decision and control (CDC) (IEEE, 2019) pp. 6479–6486
2019
Cited alongside, same era.
X. Guo, A. Hu, R. Xu, and J. Zhang, “Learning mean-field games,” Advances in Neural Information Processing Systems 32
2019
Cited alongside, same era.
2019
Cited alongside, same era.
J. Subramanian and A. Mahajan, “Reinforcement learning in stationary mean-field games,” in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (2019) pp. 251–259
2019
Cited alongside, same era.
P. E. Caines and M. Huang, “Graphon mean field games and the GMFG equations: ε \varepsilon -Nash equilibria,” in 2019 IEEE 58th Conference on Decision and Control (CDC) (IEEE, 2019) pp. 286–292
2019
Cited alongside, same era.
C. Borgs, J. Chayes, H. Cohn, and Y. Zhao, “An l p l^{p} theory of sparse graph convergence i: Limits, sparse random graph models, and power law distributions,” Transactions of the American Mathematical Society 372
2019
Cited alongside, same era.
L. Horstmeyer and C. Kuehn, “Adaptive voter model on simplicial complexes,” Physical Review E 101
2020
Cited alongside, same era.
2021
Later among the works it cites.
2021
Later among the works it cites.
B. Anahtarci, C. D. Kariksiz, and N. Saldi, “Learning in discrete-time average-cost mean-field games,” in 2021 60th IEEE Conference on Decision and Control (CDC) (2021) pp. 3048–3053
2021
Later among the works it cites.
2021
Later among the works it cites.
K. Cui, A. Tahir, M. Sinzger, and H. Koeppl, “Discrete-time mean field control with environment states,” in 2021 IEEE 60th Conference on Decision and Control (CDC) (2021) pp. 5239–5246
2021
Later among the works it cites.
P. E. Caines, “Mean field games,” in Encyclopedia of systems and control (Springer, 2021) pp. 1197–1202
2021
Later among the works it cites.
2021
Later among the works it cites.
K. Huang, X. Chen, X. Di, and Q. Du, “Dynamic driving and routing games for autonomous vehicles on networks: A mean field game approach,” Transportation Research Part C: Emerging Technologies 128
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
D. Vasal, R. Mishra, and S. Vishwanath, “Sequential decomposition of graphon mean field games,” in 2021 American Control Conference (ACC) (IEEE, 2021) pp. 730–736
2021
Later among the works it cites.
2021
Later among the works it cites.
J. Noonan and R. Lambiotte, “Dynamics of majority rule on hypergraphs,” Physical Review E 104
2021
Later among the works it cites.
X.-J. Xu, S. He, and L.-J. Zhang, “Dynamics of the threshold model on hypergraphs,” Chaos: An Interdisciplinary Journal of Nonlinear Science 32
2022
Closest in time.
M. S. Anwar and D. Ghosh, “Intralayer and interlayer synchronization in multiplex network with higher-order interactions,” Chaos: An Interdisciplinary Journal of Nonlinear Science 32
2022
Closest in time.
C. Ziegler, P. S. Skardal, H. Dutta, and D. Taylor, “Balanced hodge laplacians optimize consensus dynamics over simplicial complexes,” Chaos: An Interdisciplinary Journal of Nonlinear Science 32
2022
Closest in time.
X. Guo, R. Xu, and T. Zariphopoulou, “Entropy regularization for mean field games with learning,” Mathematics of Operations Research (2022)
2022
Closest in time.
2022
Closest in time.
K. Cui and H. Koeppl, “Learning graphon mean field games and approximate Nash equilibria,” in International Conference on Learning Representations (2022)
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.