Ricardo Ribeiro

In this paper, we address the problem of optimizing flows on generalized graphs that feature multiple entry points and multiple populations, each with varying cost structures. We tackle this problem by considering the multi-population Wardrop equilibrium, defined through variational inequalities. We rigorously analyze the existence and uniqueness of the Wardrop equilibrium. Furthermore, we introduce an efficient numerical method to find the solution. In particular, we reformulate the equilibrium problem as a distributed optimization problem over subgraphs and introduce a novel Hessian Riemannian flow method, a Riemannian-manifold-projected Hessian flow, to efficiently compute a solution. Finally, we demonstrate the effectiveness of our approach through examples in urban traffic management, including routing for diverse vehicle types and strategies for minimizing emissions in congested environments.

We explore the relationship between Wardrop equilibrium and stationary mean-field games (MFG) on networks with flow-dependent costs. First, we present the notion of Wardrop equilibrium and the first-order MFG model on networks. We then reformulate the MFG problem into a road traffic problem, establishing that the flow distribution of the MFG solution is the corresponding Wardrop equilibrium. Next, we prove that the solution of the MFG model can be recovered using the corresponding Wardrop equilibrium. Next, we examine the cost properties and calibrate MFG with respect to travel cost problems on networks. We propose a novel calibration approach for MFGs. Additionally, we demonstrate that non-monotonic MFGs can be generated by even simple travel costs.

We consider a market where a finite number of players trade an asset whose supply is a stochastic process. The price formation problem consists of finding a price process that ensures that when agents act optimally to minimize their trading costs, the market clears, and supply meets demand. This problem arises in market economies, including electricity generation from renewable sources in smart grids. Our model includes noise on the supply side, which is counterbalanced on the consumption side by storing energy or reducing the demand according to a dynamic price process. By solving a constrained minimization problem, we prove that the Lagrange multiplier corresponding to the market-clearing condition defines the solution of the price formation problem. For the linear-quadratic structure, we characterize the price process of a continuum population using optimal control techniques. We include numerical schemes for the price computation in the finite and infinite games, and we illustrate the model using real data.

We consider a market where a finite number of players trade an asset whose supply is a stochastic process. The price formation problem consists of finding a price process that ensures that when agents act optimally to minimize their trading costs, the market clears, and supply meets demand. This problem arises in market economies, including electricity generation from renewable sources in smart grids. Our model includes noise on the supply side, which is counterbalanced on the consumption side by storing energy or reducing the demand according to a dynamic price process. By solving a constrained minimization problem, we prove that the Lagrange multiplier corresponding to the market-clearing condition defines the solution of the price formation problem. For the linear-quadratic structure, we characterize the price process of a continuum population using optimal control techniques. We include numerical schemes for the price computation in the finite and infinite games, and we illustrate the model using real data.

We study a particle approximation for one-dimensional first-order Mean-Field-Games (MFGs) with local interactions with planning conditions. Our problem comprises a system of a Hamilton-Jacobi equation coupled with a transport equation. As we deal with the planning problem, we prescribe initial and terminal distributions for the transport equation. The particle approximation builds on a semi-discrete variational problem. First, we address the existence and uniqueness of a solution to the semi-discrete variational problem. Next, we show that our discretization preserves some previously identified conserved quantities. Finally, we prove that the approximation by particle systems preserves displacement convexity. We use this last property to establish uniform estimates for the discrete problem. We illustrate our results for the discrete problem with numerical examples.

In this paper, we propose a mean-field game model for the price formation of a commodity whose production is subjected to random fluctuations. The model generalizes existing deterministic price formation models. Agents seek to minimize their average cost by choosing their trading rates with a price that is characterized by a balance between supply and demand. The supply and the price processes are assumed to follow stochastic differential equations. Here, we show that, for linear dynamics and quadratic costs, the optimal trading rates are determined in feedback form. Hence, the price arises as the solution to a stochastic differential equation, whose coefficients depend on the solution of a system of ordinary differential equations.

In this paper, we propose a mean-field game model for the price formation of a commodity whose production is subjected to random fluctuations. The model generalizes existing deterministic price formation models. Agents seek to minimize their average cost by choosing their trading rates with a price that is characterized by a balance between supply and demand. The supply and the price processes are assumed to follow stochastic differential equations. Here, we show that, for linear dynamics and quadratic costs, the optimal trading rates are determined in feedback form. Hence, the price arises as the solution to a stochastic differential equation, whose coefficients depend on the solution of a system of ordinary differential equations.