Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Mean-field games among teams (2310.12282v1)

Published 18 Oct 2023 in cs.GT, cs.MA, cs.SY, and eess.SY

Abstract: In this paper, we present a model of a game among teams. Each team consists of a homogeneous population of agents. Agents within a team are cooperative while the teams compete with other teams. The dynamics and the costs are coupled through the empirical distribution (or the mean field) of the state of agents in each team. This mean-field is assumed to be observed by all agents. Agents have asymmetric information (also called a non-classical information structure). We propose a mean-field based refinement of the Team-Nash equilibrium of the game, which we call mean-field Markov perfect equilibrium (MF-MPE). We identify a dynamic programming decomposition to characterize MF-MPE. We then consider the case where each team has a large number of players and present a mean-field approximation which approximates the game among large-population teams as a game among infinite-population teams. We show that MF-MPE of the game among teams of infinite population is easier to compute and is an $\varepsilon$-approximate MF-MPE of the game among teams of finite population.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. J. Arabneydi and A. Mahajan. Team optimal control of coupled subsystems with mean-field sharing. In IEEE Conference on Decision and Control, pages 1669–1674. IEEE, 2014.
  2. J. Arabneydi and A. Mahajan. Linear quadratic mean field teams: Optimal and approximately optimal decentralized solutions. arXiv:1609.00056v2, 2016.
  3. N. Bäuerle. Mean field markov decision processes. Applied Mathematics & Optimization, 88(1):12, 2023.
  4. Simulation-based Algorithms for Markov Decision Processes. Communications and Control Engineering. Springer, 2007. ISBN 9781846286896.
  5. Discrete time mean-field stochastic linear-quadratic optimal control problems. Automatica, 49(11):3222–3233, 2013.
  6. Zero-sum games between mean-field teams: A common information and reachability based analysis, 2023. arxiv:2303.12243.
  7. Large-population cost-coupled LQG problems with nonuniform agents: individual-mass behavior and decentralized epsilon-Nash equilibria. IEEE Trans. Autom. Control, 52(9):1560–1571, 2007.
  8. Social optima in mean field LQG control: centralized and decentralized strategies. IEEE Trans. Autom. Control, 57(7):1736–1751, 2012.
  9. Mean field games. Japanese Journal of Mathematics, 2(1):229–260, 2007.
  10. J. Marschak and R. Radner. Economic theory of teams. Yale University Press, 1972.
  11. E. Maskin and J. Tirole. A theory of dynamic oligopoly, I: Overview and quantity competition with large fixed costs. Econometrica: Journal of the Econometric Society, pages 549–569, 1988a.
  12. E. Maskin and J. Tirole. A theory of dynamic oligopoly, II: Price competition, kinked demand curves, and edgeworth cycles. Econometrica: Journal of the Econometric Society, pages 571–599, 1988b.
  13. Decentralized stochastic control with partial history sharing: A common information approach. IEEE Trans. Autom. Control, 58(7):1644–1658, 2013.
  14. Common information based Markov perfect equilibria for stochastic games with asymmetric information: Finite games. IEEE Transactions on Automatic Control, 59(3):555–570, 2014.
  15. Collective multiagent sequential decision making under uncertainty. In AAAI Conference on Artificial Intelligence, pages 3036–3043, 2017.
  16. A. R. Pedram and T. Tanaka. Linearly-solvable mean-field approximation for multi-team road traffic games. In 2019 IEEE 58th Conference on Decision and Control (CDC), pages 1243–1248, 2019.
  17. Nash equilibria for exchangeable team against team games, their mean field limit, and role of common randomness. In American Control Conference, 2023.
  18. L. S. Shapley. A value for n-person games. Contributions to the Theory of Games, 2(28):307–317, 1953.
  19. A. Sinha and A. Mahajan. Sensitivity of Whittle index policy to model approximation. Under review, 2023. URL https://cim.mcgill.ca/~adityam/projects/bandits/preprint/approx-Whittle.pdf.
  20. Optimal transport: Fast probabilistic approximation with exact solvers, 2018.
  21. Approximate information state for approximate planning and reinforcement learning in partially observed systems. Journal of Machine Learning Research, 23(12):1–83, 2022. ISSN 1533-7928.
  22. Dynamic games among teams with delayed intra-team information Sharing. Dynamic Games and Applications, Feb. 2022.
  23. P. Tilghman. Will rule the airwaves: A DARPA grand challenge seeks autonomous radios to manage the wireless spectrum. IEEE Spectrum, 56(6):28–33, 2019.
  24. J. von Neumann and O. Morgenstern. Theory of games and economic behavior. Princeton University Press, 1944.
  25. Markov perfect industry dynamics with many firms. Econometrica, 76(6):1375–1411, 2008.
  26. H. S. Witsenhausen. The intrinsic model for discrete stochastic control: Some open problems. In A. Bensoussan and J. L. Lions, editors, Control Theory, Numerical Methods and Computer Systems Modelling, pages 322–335, Berlin, Heidelberg, 1975. Springer Berlin Heidelberg.
  27. Teamwise mean field competitions. Applied Mathematics & Optimization, 84(1):903–942, Dec. 2021.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now