In this paper, we examine the stationary relaxed singular control problem within a multidimensional framework for a single agent as well as its mean field game equivalent. We demonstrate that optimal relaxed controls exist for two problem classes: one driven by queueing control and the other by harvesting models. These relaxed controls are defined by random measures across the state and control spaces with the state process described as a solution to the associated martingale problem. By leveraging findings from Kurtz and Stockbridge (2001), we establish the equivalence between the martingale problem and the stationary forward equation. This allows us to reformulate the relaxed control problem into a linear programming problem within the measure space. We prove the sequential compactness of these measures, thereby confirming the feasibility of achieving an optimal solution. Subsequently, our focus shifts to mean field games. Drawing on insights from the single-agent problem and employing the Kakutani–Glicksberg–Fan fixed point theorem, we derive the existence of a mean field game equilibria.
Read full abstract- All Solutions
Editage
One platform for all researcher needs
Paperpal
AI-powered academic writing assistant
R Discovery
Your #1 AI companion for literature search
Mind the Graph
AI tool for graphics, illustrations, and artwork
Journal finder
AI-powered journal recommender
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus - Support
Overview
645 Articles
Published in last 50 years
Related Topics
Articles published on Agent Framework
Authors
Select Authors
Journals
Select Journals
Duration
Select Duration
615 Search results
Sort by Recency