Fetching the paper…
Reading the bibliography…
This paper studies approximate solutions to large-scale linear quadratic stochastic games with homogeneous nodal dynamics parameters and heterogeneous network couplings within the graphon mean field game framework in [2]-[4].
A. Pazy, Semigroups of Linear Operators and Applications to Partial Differential Equations , ser. Applied Mathematical Sciences. New York: Springer, 1983
1983
Earlier work this paper cites.
R. E. Showalter, Monotone operators in Banach space and nonlinear partial differential equations . American Mathematical Soc., 1997, vol. 49
1997
Earlier work this paper cites.
T. Başar and G. J. Olsder, Dynamic noncooperative game theory . SIAM, 1998
1998
Earlier work this paper cites.
J. Munkres, Topology , 2nd ed. Upper Saddle River, NJ : Prentice Hall, Inc, 2000
2000
Earlier work this paper cites.
A. Bensoussan, G. Da Prato, M. C. Delfour, and S. Mitter, Representation and Control of Infinite Dimensional Systems , 2nd ed. Springer Science & Business Media, 2007
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, “Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing,” Advances in Mathematics , vol. 219, no. 6, pp. 1801–1851, 2008
2008
Earlier work this paper cites.
M. Huang, P. E. Caines, and R. P. Malhamé, “The NCE (mean field) principle with locality dependent cost interactions,” IEEE Transactions on Automatic Control , vol. 55, no. 12, pp. 2799–2805, 2010
2010
Earlier work this paper cites.
——, “Convergent sequences of dense graphs ii. multiway cuts and statistical physics,” Annals of Mathematics , vol. 176, no. 1, pp. 151–219, 2012
2012
Earlier work this paper cites.
L. Lovász, Large Networks and Graph Limits . American Mathematical Soc., 2012, vol. 60
2012
Earlier work this paper cites.
Z. Han, D. Niyato, W. Saad, T. Başar, and A. Hjørungnes, Game theory in wireless and communication networks: theory, models, and applications . Cambridge university press, 2012
2012
Earlier work this paper cites.
M. Huang, P. E. Caines, and R. P. Malhamé, “Social optima in mean field LQG control: centralized and decentralized strategies,” IEEE Transactions on Automatic Control , vol. 57, no. 7, pp. 1736–1751, 2012
2012
Earlier work this paper cites.
F. L. Lewis, H. Zhang, K. Hengster-Movric, and A. Das, Cooperative control of multi-agent systems: optimal and adaptive design approaches . Springer Science & Business Media, 2013
2013
Earlier work this paper cites.
E. M. Airoldi, T. B. Costa, and S. H. Chan, “Stochastic blockmodel approximation of a graphon: Theory and consistent estimation,” in Advances in Neural Information Processing Systems , 2013, pp. 692–700
2013
Earlier work this paper cites.
G. S. Medvedev, “The nonlinear heat equation on dense graphs and graph limits,” SIAM Journal on Mathematical Analysis , vol. 46, no. 4, pp. 2743–2766, 2014
2014
Earlier work this paper cites.
——, “The nonlinear heat equation on w-random graphs,” Archive for Rational Mechanics and Analysis , vol. 212, no. 3, pp. 781–803, 2014
2014
Earlier work this paper cites.
M. O. Jackson and Y. Zenou, “Games on networks,” in Handbook of game theory with economic applications . Elsevier, 2015, vol. 4, pp. 95–163
2015
Cited alongside, same era.
O. Guéant, “Existence and uniqueness result for mean field games with congestion effect on graphs,” Applied Mathematics & Optimization , vol. 72, no. 2, pp. 291–303, 2015
2015
Cited alongside, same era.
F. Camilli and C. Marchi, “Stationary mean field games systems defined on networks,” SIAM Journal on Control and Optimization , vol. 54, no. 2, pp. 1085–1103, 2016
2016
Cited alongside, same era.
A. Bensoussan, K. Sung, S. C. P. Yam, and S.-P. Yung, “Linear-quadratic mean field games,” Journal of Optimization Theory and Applications , vol. 169, no. 2, pp. 496–529, 2016
2016
Cited alongside, same era.
2019
Later among the works it cites.
S. Gao, “Graphon control theory for linear systems on complex networks and related topics,” Ph.D. dissertation, McGill University, 2019
2019
Later among the works it cites.
S. Janson, “Graphons, cut norm and distance, couplings and rearrangements,” New York Journal of Mathematics , vol. 4, 2013
2019
Later among the works it cites.
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
F. Delarue, “Mean field games: A toy model on an Erdös-Renyi graph.” ESAIM. Proceedings and Surveys , vol. 60, 2017
2017
Cited alongside, same era.
P. E. Caines and M. Huang, “Graphon mean field games and the GMFG equations,” in Proceedings of the 57th IEEE Conference on Decision and Control (CDC) , December 2018, pp. 4129–4134
2018
Cited alongside, same era.
M. Avella-Medina, F. Parise, M. T. Schaub, and S. Segarra, “Centrality measures for graphons: Accounting for uncertainty in networks,” IEEE Transactions on Network Science and Engineering , vol. 7, no. 1, pp. 520–537, 2018
2018
Cited alongside, same era.
——, “Graphon linear quadratic regulation of large-scale networks of linear systems,” in Proceedings of the 57th IEEE Conference on Decision and Control (CDC) , Miami Beach, FL, USA, December 2018, pp. 5892–5897
2018
Cited alongside, same era.
F. Parise and A. Ozdaglar, “Graphon games,” arXiv preprint arXiv:1802.00080 , 2018
2018
Cited alongside, same era.
——, “Graphon mean field games and the GMFG equations: ε \varepsilon -Nash equilibria,” in Proceedings of the 58th IEEE Conference on Decision and Control (CDC) , December 2019, pp. 286–292
2019
Cited alongside, same era.
H. Chiba and G. S. Medvedev, “The mean field analysis of the Kuramoto model on graphs I. the mean field equation and transition point formulas,” Discrete and Continuous Dynamical Systems-Series A , vol. 39, no. 1, pp. 131–155, 2019
2019
Cited alongside, same era.
2020
Closest in time.
R. Vizuete, P. Frasca, and F. Garin, “Graphon-based sensitivity analysis of sis epidemics,” IEEE Control Systems Letters , vol. 4, no. 3, pp. 542–547, 2020
2020
Closest in time.
——, “Graphon control of large-scale networks of linear systems,” IEEE Transactions on Automatic Control , vol. 65, no. 10, pp. 4090–4105, 2020
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
R. Salhab, R. P. Malhamé, and J. L. Ny, “Collective stochastic discrete choice problems: A Min-LQG dynamic game formulation,” IEEE Transactions on Automatic Control , vol. 65, no. 8, pp. 3302–3316, 2020
2020
Closest in time.
M. Huang and M. Zhou, “Linear quadratic mean field games: Asymptotic solvability and relation to the fixed point approach,” IEEE Transactions on Automatic Control , vol. 65, no. 4, pp. 1397–1412, 2020
2020
Closest in time.
S. Gao, P. E. Caines, and M. Huang, “LQG graphon mean field games: Graphon invariant subspaces,” Accepted by
2021
Closest in time.
——, “Subspace decomposition for graphon LQR: Applications to VLSNs of harmonic oscillators,” IEEE Transactions on Control of Network Systems , vol. 8, no. 2, pp. 576–586, 2021, doi: 10.1109/TCNS.2021.3058923
2021
Closest in time.
S. Gao, R. Foguen Tchuendom, and P. E. Caines, “Linear quadratic graphon field games,” Communications in Information and Systems , vol. 21, no. 3, pp. 341–369, 2021
2021
Closest in time.