Mean-field-type games

22Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article examines games in which the payoffs and the state dynamics depend not only on the state-action profile of the decision-makers but also on a measure of the state-action pair. These game situations, also referred to as mean-field-type games, involve novel equilibrium systems to be solved. Three solution approaches are presented: (i) dynamic programming principle, (ii) stochastic maximum principle, (iii) Wiener chaos expansion. Relationship between dynamic programming and stochastic maximum principle are established using sub/super weak differentials. In the non-convex control action spaces, connections between the second order weaker differentials of the dual function and second order adjoint processes are provided. Multi-index Wiener chaos expansions are used to transform the non-standard game problems into standard ones with ordinary differential equations. Aggregative and moment-based mean-field-type games are discussed.

Cite

CITATION STYLE

APA

Tembine, H. (2017). Mean-field-type games. AIMS Mathematics, 2(4), 706–735. https://doi.org/10.3934/Math.2017.4.706

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free