{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:52:31Z","timestamp":1776109951583,"version":"3.50.1"},"reference-count":20,"publisher":"The Open Journal","issue":"120","license":[{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JOSS"],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.21105\/joss.10137","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:20:08Z","timestamp":1776104408000},"page":"10137","source":"Crossref","is-referenced-by-count":0,"title":["MFGLib: A Library for Mean-Field Games"],"prefix":"10.21105","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3350-4606","authenticated-orcid":false,"given":"Xin","family":"Guo","sequence":"first","affiliation":[{"name":"University of California, Berkeley, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6781-0900","authenticated-orcid":false,"given":"Anran","family":"Hu","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1406-2083","authenticated-orcid":false,"given":"Matteo","family":"Santamaria","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0290-5255","authenticated-orcid":false,"given":"Mahan","family":"Tajrobehkar","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5086-0063","authenticated-orcid":false,"given":"Junzi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Citadel Securities, USA"}]}],"member":"8722","reference":[{"issue":"1","key":"lasry:2007","doi-asserted-by":"publisher","DOI":"10.1007\/s11537-007-0657-8","article-title":"Mean field games","volume":"2","author":"Lasry","year":"2007","unstructured":"Lasry, J.-M., & Lions, P.-L. (2007). Mean field games. Japanese Journal of Mathematics, 2(1), 229\u2013260. https:\/\/doi.org\/10.1007\/s11537-007-0657-8","journal-title":"Japanese Journal of Mathematics"},{"key":"perolat:2021","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2103.00623","article-title":"Scaling up mean field games with online mirror descent","author":"Perolat","year":"2021","unstructured":"Perolat, J., Perrin, S., Elie, R., Lauri\u00e8re, M., Piliouras, G., Geist, M., Tuyls, K., & Pietquin, O. (2021). Scaling up mean field games with online mirror descent. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2103.00623","journal-title":"arXiv"},{"key":"cui:2021","article-title":"Approximately solving mean field games via entropy-regularized deep reinforcement learning","author":"Cui","year":"2021","unstructured":"Cui, K., & Koeppl, H. (2021). Approximately solving mean field games via entropy-regularized deep reinforcement learning. International Conference on Artificial Intelligence and Statistics, 1909\u20131917.","journal-title":"International conference on artificial intelligence and statistics"},{"key":"perrin:2020","article-title":"Fictitious play for mean field games: Continuous time analysis and applications","volume":"33","author":"Perrin","year":"2020","unstructured":"Perrin, S., P\u00e9rolat, J., Lauri\u00e8re, M., Geist, M., Elie, R., & Pietquin, O. (2020). Fictitious play for mean field games: Continuous time analysis and applications. Advances in Neural Information Processing Systems, 33, 13199\u201313213.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"lanctot:2019","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1908.09453","article-title":"OpenSpiel: A framework for reinforcement learning in games","volume":"abs\/1908.09453","author":"Lanctot","year":"2019","unstructured":"Lanctot, M., Lockhart, E., Lespiau, J.-B., Zambaldi, V., Upadhyay, S., P\u00e9rolat, J., Srinivasan, S., Finbarr Timbers, \u2019, Tuyls, K., Omidshafiei, S., Hennes, D., Morrill, D., Muller, P., Ewalds, T., Faulkner, R., Kram\u00e1r, J., Vylder, B. D., Saeta, B., Bradbury, J., \u2026 Ryan-Davis, J. (2019). OpenSpiel: A framework for reinforcement learning in games. CoRR, abs\/1908.09453. https:\/\/doi.org\/10.48550\/arXiv.1908.09453","journal-title":"CoRR"},{"issue":"30","key":"knight:2018","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00904","article-title":"Nashpy: A Python library for the computation of Nash equilibria","volume":"3","author":"Knight","year":"2018","unstructured":"Knight, V., & Campbell, J. (2018). Nashpy: A Python library for the computation of Nash equilibria. Journal of Open Source Software, 3(30), 904. https:\/\/doi.org\/10.21105\/joss.00904","journal-title":"Journal of Open Source Software"},{"issue":"93","key":"batista:2024","doi-asserted-by":"publisher","DOI":"10.21105\/joss.05585","article-title":"QuantEcon.py: A community based Python library for quantitative economics","volume":"9","author":"Batista","year":"2024","unstructured":"Batista, Q., Coleman, C., Furusawa, Y., Hu, S., Lunagariya, S., Lyon, S., McKay, M., Oyama, D., Sargent, T. J., Shi, Z., Stachurski, J., Winant, P., Watkins, N., Yang, Z., & Zhang, H. (2024). QuantEcon.py: A community based Python library for quantitative economics. Journal of Open Source Software, 9(93), 5585. https:\/\/doi.org\/10.21105\/joss.05585","journal-title":"Journal of Open Source Software"},{"key":"cui:2022","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2112.01280","article-title":"Learning graphon mean field games and approximate Nash equilibria","author":"Cui","year":"2022","unstructured":"Cui, K., & Koeppl, H. (2022). Learning graphon mean field games and approximate Nash equilibria. https:\/\/doi.org\/10.48550\/arXiv.2112.01280"},{"issue":"08","key":"benamou:2019","doi-asserted-by":"publisher","DOI":"10.1142\/S0218202519500283","article-title":"An entropy minimization approach to second-order variational mean-field games","volume":"29","author":"Benamou","year":"2019","unstructured":"Benamou, J.-D., Carlier, G., Di Marino, S., & Nenna, L. (2019). An entropy minimization approach to second-order variational mean-field games. Mathematical Models and Methods in Applied Sciences, 29(08), 1553\u20131583. https:\/\/doi.org\/10.1142\/S0218202519500283","journal-title":"Mathematical Models and Methods in Applied Sciences"},{"issue":"3","key":"hu:2024","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-025-10328-5","article-title":"MF-OML: Online mean-field reinforcement learning with occupation measures for large population games","volume":"92","author":"Hu","year":"2025","unstructured":"Hu, A., & Zhang, J. (2025). MF-OML: Online mean-field reinforcement learning with occupation measures for large population games. Appl. Math. Optim., 92(3). https:\/\/doi.org\/10.1007\/s00245-025-10328-5","journal-title":"Appl. Math. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/0095-4616","issn-type":"print"},{"issue":"1","key":"guo:2023","doi-asserted-by":"publisher","DOI":"10.1137\/22M1524084","article-title":"MF-OMO: An optimization formulation of mean-field games","volume":"62","author":"Guo","year":"2024","unstructured":"Guo, X., Hu, A., & Zhang, J. (2024). MF-OMO: An optimization formulation of mean-field games. SIAM Journal on Control and Optimization, 62(1), 243\u2013270. https:\/\/doi.org\/10.1137\/22M1524084","journal-title":"SIAM Journal on Control and Optimization"},{"key":"akiba:2019","doi-asserted-by":"crossref","DOI":"10.1145\/3292500.3330701","article-title":"Optuna: A next-generation hyperparameter optimization framework","author":"Akiba","year":"2019","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., & Koyama, M. (2019). Optuna: A next-generation hyperparameter optimization framework. Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2623\u20132631.","journal-title":"Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining"},{"issue":"3","key":"huang:2006","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2006.v6.n3.a5","article-title":"Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle","volume":"6","author":"Huang","year":"2006","unstructured":"Huang, M., Malham\u00e9, R. P., & Caines, P. E. (2006). Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle. Communications in Information & Systems, 6(3), 221\u2013252. https:\/\/doi.org\/10.4310\/CIS.2006.v6.n3.a5","journal-title":"Communications in Information & Systems"},{"key":"guo:2019","article-title":"Learning mean-field games","volume":"32","author":"Guo","year":"2019","unstructured":"Guo, X., Hu, A., Xu, R., & Zhang, J. (2019). Learning mean-field games. Advances in Neural Information Processing Systems, 32.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"kizilkale:2019","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.11.029","article-title":"An integral control formulation of mean field game based large scale coordination of loads in smart grids","volume":"100","author":"Kizilkale","year":"2019","unstructured":"Kizilkale, A. C., Salhab, R., & Malham\u00e9, R. P. (2019). An integral control formulation of mean field game based large scale coordination of loads in smart grids. Automatica, 100, 312\u2013322. https:\/\/doi.org\/10.1016\/j.automatica.2018.11.029","journal-title":"Automatica"},{"key":"cabannes:2021","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2110.11943","article-title":"Solving N-player dynamic routing games with congestion: A mean field approach","author":"Cabannes","year":"2021","unstructured":"Cabannes, T., Lauriere, M., Perolat, J., Marinier, R., Girgin, S., Perrin, S., Pietquin, O., Bayen, A. M., Goubault, E., & Elie, R. (2021). Solving N-player dynamic routing games with congestion: A mean field approach. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2110.11943","journal-title":"arXiv"},{"key":"guo:2023:mesob","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2307.07911","article-title":"MESOB: Balancing equilibria & social optimality","author":"Guo","year":"2023","unstructured":"Guo, X., Li, L., Nabi, S., Salhab, R., & Zhang, J. (2023). MESOB: Balancing equilibria & social optimality. https:\/\/doi.org\/10.48550\/arXiv.2307.07911"},{"key":"becherer:2025","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2309.07877","article-title":"Mean-field games of speedy information access with observation costs","author":"Becherer","year":"2025","unstructured":"Becherer, D., Reisinger, C., & Tam, J. (2025). Mean-field games of speedy information access with observation costs. https:\/\/doi.org\/10.48550\/arXiv.2309.07877"},{"key":"yardim:2024","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2408.15173","article-title":"Exploiting approximate symmetry for efficient multi-agent reinforcement learning","author":"Yardim","year":"2024","unstructured":"Yardim, B., & He, N. (2024). Exploiting approximate symmetry for efficient multi-agent reinforcement learning. https:\/\/doi.org\/10.48550\/arXiv.2408.15173"},{"key":"fridovich:2020","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197129","article-title":"Efficient iterative linear-quadratic approximations for nonlinear multi-player general-sum differential games","author":"Fridovich-Keil","year":"2020","unstructured":"Fridovich-Keil, D., Ratner, E., Peters, L., Dragan, A. D., & Tomlin, C. J. (2020). Efficient iterative linear-quadratic approximations for nonlinear multi-player general-sum differential games. 2020 IEEE International Conference on Robotics and Automation (ICRA), 1475\u20131481. https:\/\/doi.org\/10.1109\/ICRA40945.2020.9197129","journal-title":"2020 IEEE international conference on robotics and automation (ICRA)"}],"container-title":["Journal of Open Source Software"],"original-title":[],"link":[{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.10137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:20:11Z","timestamp":1776104411000},"score":1,"resource":{"primary":{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.10137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,13]]},"references-count":20,"journal-issue":{"issue":"120","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["10.21105\/joss.10137"],"URL":"https:\/\/doi.org\/10.21105\/joss.10137","relation":{"has-review":[{"id-type":"uri","id":"https:\/\/github.com\/openjournals\/joss-reviews\/issues\/10137","asserted-by":"subject"}],"references":[{"id-type":"doi","id":"10.5281\/zenodo.19375906","asserted-by":"subject"}]},"ISSN":["2475-9066"],"issn-type":[{"value":"2475-9066","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,13]]}}}