. This paper proposes and studies a general form of dynamic \ (N\) -player noncooperative games called \ (\) -potential games, where the change of a player's objective function upon her unilateral deviation from her strategy is equal to the change of an \ (\) -potential function up to an error \ (\). Analogous to the static potential game (which corresponds to \ (=0\) ), the \ (\) -potential game framework is shown to reduce the challenging task of finding \ (\) -Nash equilibria for a dynamic game to minimizing the \ (\) -potential function. Moreover, an analytical characterization of \ (\) -potential functions is established, with \ (\) represented in terms of the magnitude of the asymmetry of objective functions' second-order derivatives. For stochastic differential games in which the state dynamic is a controlled diffusion, \ (\) is characterized in terms of the number of players, the choice of admissible strategies, and the intensity of interactions and the level of heterogeneity among players. Two classes of stochastic differential games, namely, distributed games and games with mean field interactions, are analyzed to highlight the dependence of \ (\) on general game characteristics that are beyond the mean field paradigm, which focuses on the limit of \ (N\) with homogeneous players. To analyze the \ (\) -NE (Nash equilibrium), the associated optimization problem is embedded into a conditional McKean–Vlasov control problem. A verification theorem is established to construct \ (\) -NE based on solutions to an infinite-dimensional Hamilton–Jacobi–Bellman equation, which is reduced to a system of ordinary differential equations for linear-quadratic games. Keywordspotential gameNash equilibriumsensitivity processMcKean-Vlasov controlmean field gamedistributed gamelinear-quadratic network gameMSC codes91A0691A1591A1491A16
Guo et al. (Wed,) studied this question.