Dynamic Price Competition with Price Adjustment Costs and Product Differentiation

We study a discrete time dynamic game of price competition with spatially differentiated products and price adjustment costs. We characterise the Markov perfect and the open-loop equilibrium of our game. We find that in the steady state Markov perfect equilibrium, given the presence of adjustment costs, equilibrium prices are always higher than prices at the repeated static Nash solution, even though, adjustment costs are not paid in steady state. This is due to intertemporal strategic complementarity in the strategies of the firms and from the fact that the cost of adjusting prices adds credibility to high price equilibrium strategies. On the other hand, the stationary open-loop equilibrium coincides always with the static solution. Furthermore, in contrast to continuous time games, we show that the stationary Markov perfect equilibrium converges to the static Nash equilibrium when adjustment costs tend to zero. Moreover, we obtain the same convergence result when adjustment costs tend to infinity.Price adjustment costs, Difference game, Markov perfect equilibrium, Open-loop equilibrium

Decentralized Convergence to Nash Equilibria in Constrained Deterministic Mean Field Control

This paper considers decentralized control and optimization methodologies for large populations of systems, consisting of several agents with different individual behaviors, constraints and interests, and affected by the aggregate behavior of the overall population. For such large-scale systems, the theory of aggregative and mean field games has been established and successfully applied in various scientific disciplines. While the existing literature addresses the case of unconstrained agents, we formulate deterministic mean field control problems in the presence of heterogeneous convex constraints for the individual agents, for instance arising from agents with linear dynamics subject to convex state and control constraints. We propose several model-free feedback iterations to compute in a decentralized fashion a mean field Nash equilibrium in the limit of infinite population size. We apply our methods to the constrained linear quadratic deterministic mean field control problem and to the constrained mean field charging control problem for large populations of plug-in electric vehicles.Comment: IEEE Trans. on Automatic Control (cond. accepted

Nash Equilibrium Strategies in Discrete-Time Finite-Horizon Dynamic Games with Risk-and Effort-Averse Players

The objective of this paper is to re-examine the risk-and effort attitude in the context of strategic dynamic interactions stated as a discrete-time finite-horizon Nash game. The analysis is based on the assumption that players are endogenously risk-and effort-averse. Each player is characterized by distinct risk-and effort-aversion types that are unknown to his opponent. The goal of the game is the optimal risk-and effort-sharing between the players. It generally depends on the individual strategies adopted and, implicitly, on the the players' types or characteristics.Dynamic Nash game, optimal path, closed-loop control, endogenous risk-and effort-aversion, adaptive risk-and effort management, optimal risk-and effort-sharing.