SearcharxivSearch

arXiv subjects

Marcos Leutscher

Publications and source records attributed to Marcos Leutscher.

3 recordsLinked to original sources

Energy transition under scenario uncertainty: a mean-field game of stopping with common noise

We study the impact of transition scenario uncertainty, namely that of future carbon price and electricity demand, on the pace of decarbonization of the electricity industry. To this end, we develop a theory of optimal stopping mean-field games with non-Markovian common noise and partial observation. For mathematical tractability, the theory is formulated in discrete time and with common noise restricted to a finite probability space. We prove the existence of Nash equilibria for this game using the linear programming approach. We then apply the general theory to build a discrete time model for the long-term dynamics of the electricity market subject to common random shocks affecting the carbon price and the electricity demand. We consider two classes of agents: conventional producers and renewable producers. The former choose an optimal moment to exit the market and the latter choose an optimal moment to enter the market by investing into renewable generation. The agents interact through the market price determined by a merit order mechanism with an exogenous stochastic demand. We illustrate our model by an example inspired by the UK electricity market, and show that scenario uncertainty leads to significant changes in the speed of replacement of conventional generators by renewable production.

math.OC

Linear Programming Fictitious Play algorithm for Mean Field Games with optimal stopping and absorption

We develop the fictitious play algorithm in the context of the linear programming approach for mean field games of optimal stopping and mean field games with regular control and absorption. This algorithm allows to approximate the mean field game population dynamics without computing the value function by solving linear programming problems associated with the distributions of the players still in the game and their stopping times/controls. We show the convergence of the algorithm using the topology of convergence in measure in the space of subprobability measures, which is needed to deal with the lack of continuity of the flows of measures. Numerical examples are provided to illustrate the convergence of the algorithm.

math.OC

Control and optimal stopping Mean Field Games: a linear programming approach

We develop the linear programming approach to mean-field games in a general setting. This relaxed control approach allows to prove existence results under weak assumptions, and lends itself well to numerical implementation. We consider mean-field game problems where the representative agent chooses both the optimal control and the optimal time to exit the game, where the instantaneous reward function and the coefficients of the state process may depend on the distribution of the other agents. Furthermore, we establish the equivalence between mean-field games equilibria obtained by the linear programming approach and the ones obtained via the controlled/stopped martingale approach, another relaxation method used in a few previous papers in the case when there is only control.

math.OC