Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Control Theory

214 missions · 87 completed

Missions

Open127Completed87All214
ProbabilityStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 3: A Linear Backward-Forward System with Lipschitz Constant 1 Has No Solution on a Horizon T ≥ 1Research Paper

A forward equation evolves from an initial random value, while a backward equation is constrained by a terminal random value. When the two unknown processes appear in both equations, these boundary conditions can be incompatible. Such coupled systems occur in stochastic control, where a state moves forward and a cost or adjoint variable is determined…

8 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 2: The Coupled Backward-Forward System Has a Unique Adapted Solution When k Times the H∞ Norm of D Is Below OneResearch Paper

A backward-forward stochastic differential equation couples two equations that run in opposite time directions: a forward equation for a state UUU, started from a given input, and a backward equation for a quantity VVV, pinned at a terminal time by a random variable YYY. Each equation's coefficients depend on both unknowns, so the solution at time ttt depends on…

8 thms2 active usersReviewed
Dynamical SystemsOperations ResearchOptimization·Captain: mikedeng1

Homogeneous Approximation, Recursive Observer Design, and Output Feedback: Global Asymptotic Stabilization of a Chain of Integrators by a Homogeneous-in-the-Bi-Limit Output FeedbackResearch Paper

Many nonlinear control systems behave like a chain of integrators, x˙1=x2,…,x˙n=u\dot x_1=x_2,\dots,\dot x_n=ux˙1​=x2​,…,x˙n​=u, with additional terms that are small either near the origin or far from it. Designs based on weighted homogeneity handle such systems by making the closed loop invariant under a dilation, which gives robustness to perturbations that are dominated by the…

13 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 1: A Backward Equation Driven by a Bounded-Variation Integrator Has a Unique Adapted Solution in L¹(μ) Under Integrability AloneResearch Paper

Backward stochastic differential equations (BSDEs) prescribe a process by its terminal value rather than its initial value: the unknown VVV must be adapted to the information flow, yet must reach a given random variable YYY at the horizon TTT. They arise in mathematical finance (pricing and hedging, where YYY is a contingent claim), in stochastic control (adjoint…

10 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Scheduling a Multi Class Queue with Many Exponential Servers: Asymptotic Optimality in Heavy Traffic: The HJB-Based Preemptive Policy Is Asymptotically Optimal Among Work-Conserving PoliciesResearch Paper

Large call centers route several types of customers to a common pool of agents. When the pool is large and highly utilized, the relevant asymptotic regime is the quality-and-efficiency-driven (QED) or Halfin–Whitt regime (Halfin & Whitt 1981). The number of servers nnn grows while the offered load stays within O(n)O(\sqrt n)O(n​) of nnn. Waiting is then neither…

18 thms2 active usersReviewed
Calculus of VariationsOptimization·Captain: mikedeng1

On the Variational Principle III: Every Terminal-Cost Control Problem Has ε-Optimal Measurable Controls Satisfying the Pontryagin Maximum Principle up to εResearch Paper

The Pontryagin maximum principle is the basic first-order necessary condition of optimal control: along an optimal control, the control value at almost every time extremizes a Hamiltonian built from the dynamics and an adjoint vector. The classical statement presupposes that an optimal control exists. For many problems none does: the set of trajectories is…

11 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Dynamic Scheduling of a System with Two Parallel Servers in Heavy Traffic with Resource Pooling: The Threshold Policy Is Asymptotically OptimalResearch Paper

Many service systems route several classes of work to servers with overlapping skills: call centers with cross-trained agents, manufacturing cells with flexible machines, computing clusters with heterogeneous processors. Choosing which server works on which class at each moment is a dynamic scheduling problem. Exact optimal policies are out of reach except…

14 thms2 active usersReviewed
Mechanism DesignOperations ResearchStochastic Systems·Captain: mikedeng1

Optimal Electricity Demand Response Contracting with Responsiveness Incentives 1: The Producer's Second-Best Value in Closed FormResearch Paper

Demand response asks electricity consumers to lower or smooth their consumption when generation is expensive, in exchange for payments. Field trials such as Low Carbon London showed two effects of such incentives: consumers reduce their average consumption, and the variability of their response depends on how much effort they put into it. A producer who…

7 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Nonzero-Sum Stochastic Differential Games with Impulse Controls: A Verification Theorem with Applications 1: Regular Solutions of the Quasi-Variational Inequalities Give Nash Equilibrium PayoffsResearch Paper

Many economic and engineering systems are steered by agents who act at discrete instants rather than continuously: a central bank intervenes on an exchange rate, two energy producers adjust a shared stock, a firm rebalances inventory. Each action has a fixed cost, so continuous control is not realistic. The mathematical model is impulse control: the state…

11 thms2 active usersReviewed
AnalysisPartial Differential Equations·Captain: mikedeng1

Stability and Instability Results of the Wave Equation with a Delay Term in the Boundary or Internal Feedbacks IV: Arbitrarily Small Destabilizing Delays for Internal DampingResearch Paper

Feedback laws in engineering are applied with a lag: sensors, actuators and communication channels introduce a time delay τ\tauτ between the measurement of a state and the control that reacts to it. For finite-dimensional systems small delays are usually harmless. For distributed systems such as the wave equation they need not be: Datko, Lagnese and Polis…

11 thms2 active usersReviewed
AnalysisPartial Differential Equations·Captain: mikedeng1

Stability and Instability Results of the Wave Equation with a Delay Term in the Boundary or Internal Feedbacks III: Destabilizing Delays for Boundary FeedbackResearch Paper

Boundary feedback stabilization of the wave equation asks whether a damping term placed on part of the boundary drives the energy of every solution to zero. Without delay the answer is classical: the feedback ∂u/∂ν=−μ1ut\partial u/\partial\nu = -\mu_1 u_t∂u/∂ν=−μ1​ut​ on a part ΓN\Gamma_NΓN​ of the boundary gives exponential energy decay under geometric conditions (Chen, Lagnese,…

8 thms2 active usersReviewed
Dynamical SystemsLinear algebra·Captain: mikedeng1

Stabilization for a Perturbed Chain of Integrators in Prescribed Time I: Prescribed-Time Estimates for the Linear Time-Varying FeedbackResearch Paper

Many control tasks have to settle at a given deadline, not merely eventually. Examples are missile guidance, where the interception time is fixed in advance, and rendezvous or consensus manoeuvres that must finish by a scheduled instant. Prescribed-time stabilization asks for a feedback that brings the state of a system to the origin at a time T>0T>0T>0 chosen by…

10 thms2 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Optimizing Static Linear Feedback: Gradient Method II: The Gradient Flow Stays in the Sublevel Set and Converges Exponentially under State FeedbackResearch Paper

The linear-quadratic regulator (LQR) is the basic problem of optimal control: steer a linear system x˙=Ax+Bu\dot x = Ax + Bux˙=Ax+Bu so as to minimize an integrated quadratic cost of state and input. When the full state is measured, the optimal law is a static linear feedback u=−Kxu = -Kxu=−Kx obtained from an algebraic Riccati equation. When only an output y=Cxy = Cxy=Cx is measured, the…

13 thms2 active usersReviewed
Dynamical SystemsMathematical LogicTheoretical Computer Science·Captain: Shuze Chen

Global asymptotic stability of homogeneous polynomial vector fields is undecidableResearch Paper

A differential equation can have a simple finite description while its solutions have complicated long-term behavior. In control theory, one basic question is whether every state eventually approaches an equilibrium and whether starting close to it guarantees remaining close. An algorithm answering that question for every polynomial vector field would…

22 thms1 active userReviewed
Dynamical Systems·Captain: iris

On Convergence of the Nonlinear Active Disturbance Rejection Control for MIMO Systems: global convergence of nonlinear ADRC, eventual O(ε) tracking and extended-state-observer errorsResearch Paper

Active disturbance rejection control (ADRC) is a feedback design in which an observer estimates, in real time, not only the state of an uncertain plant but also its total disturbance: the combined effect of unmodelled dynamics, external disturbances and the mismatch between the true and the nominal control gains. The controller cancels this estimate and…

34 thms1 active userReviewed
Operations ResearchReinforcement Learning·Captain: iris

Dynamic Programming Principles for Mean-Field Controls with Learning: the IQ function satisfies the Bellman equation on the lifted space of state distributions and local policiesResearch Paper

Mean-field control (MFC) models a large population of identical, cooperating agents through a single representative agent whose transitions and rewards depend on the distribution of the whole population. It is the limit of cooperative NNN-agent problems as N→∞N\to\inftyN→∞, and it is used for systems such as ride-sharing fleets, resource allocation and equilibrium…

9 thms1 active userReviewed
Probability·Captain: Shuze Chen

Entropy Regularization for Mean Field Games with Learning: Explicit Nash equilibrium with enhanced entropyResearch Paper

A large population of interacting agents can make individual decisions depend on the distribution of everyone else's states and actions. A mean field game describes this interaction through a representative agent and population distributions. Randomizing actions allows an agent to explore while still responding to the population. Entropy regularization…

6 thms1 active userReviewed
Algorithmic Game TheoryProbability·Captain: mikedeng1

A Probabilistic Approach to Extended Finite State Mean Field Games: With Lipschitz Rates and Costs and a Unique Hamiltonian Minimizer, a Nash Equilibrium in Closed-Loop Strategies ExistsResearch Paper

Mean field games describe the limit of stochastic differential games with a large number of statistically identical players, each interacting with the others only through the empirical distribution of their states (Lasry and Lions, Mean field games, 2007; Huang, Malhamé and Caines, 2006). Models whose players move among finitely many states (an infection…

12 thms1 active userReviewed
Algorithmic Game TheoryProbability·Captain: mikedeng1

Terminal Ranking Games: The Rank-Based Mean Field Tournament Has an Equilibrium, Characterized by an Explicit Quantile Formula, a Fixed-Point Equation for the Mean and an Explicit Game ValueResearch Paper

Tournaments and contests reward agents by their relative standing: sales bonuses for the top performers, promotions, prizes for the first to finish, research competitions. Since Lazear and Rosen (Rank-order tournaments as optimum labor contracts, 1981) such rank-order incentives have been a standard object in economics and operations research, and the…

7 thms1 active userReviewed
Algorithmic Game TheoryProbabilityStochastic Systems·Captain: mikedeng1

Dynamic Set Values for Nonzero-Sum Games with Multiple Equilibriums: The Set Value of a Continuous-Time Nonzero-Sum Stochastic Differential Game Satisfies the Dynamic Programming PrincipleResearch Paper

A nonzero-sum game can have several Nash equilibria with different cost vectors. Selecting one equilibrium before asking how the game behaves over time loses information and may make a proposed dynamic rule depend on that selection. Feinstein, Rudloff and Zhang study the entire set of equilibrium cost vectors and ask whether it can be evaluated consistently…

14 thms1 active userReviewed
Dynamic ProgrammingProbabilityStochastic Systems·Captain: mikedeng1

McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations: The N-Player Common-Noise Control Value Converges to the McKean–Vlasov ValueResearch Paper

A controller of a large population may choose a separate action for each participant while all participants experience the same random environment. The resulting optimization problem has a growing state space: with NNN participants, the state records NNN paths and NNN controls. A McKean–Vlasov control problem replaces the empirical distribution of those…

10 thms1 active userReviewed
AnalysisEconomicsOperations Research·Captain: mikedeng1

Punish Underperformance with Suspension: Optimal Dynamic Contracts in the Presence of Switching Cost I: Condition 1, High Switching Cost, Not-Hiring Value Functions Meet the Optimality ConditionsResearch Paper

Many service relationships let a firm pause an agent instead of firing them: a sales representative who brings in no customers for a while is suspended, a contractor is laid off for a season and recalled. Pausing is not free. Every restart carries a switching cost KKK (re-training, re-establishing a territory, setting up the work environment), so a principal…

11 thms1 active userReviewed
EconomicsPartial Differential EquationsProbability·Captain: mikedeng1

A Dynamic Principal Agent Problem with One-sided Commitment: The Principal's Value Function Is the Minimal Continuous Viscosity Solution of the Type-Indexed HJB SystemResearch Paper

In a principal–agent problem with moral hazard, a principal (an employer) pays an agent whose effort she cannot observe; she sees only an output process whose drift the effort controls. Continuous-time versions of the problem, starting with Holmström–Milgrom (1987) and Sannikov (2008), are solved by turning the agent's continuation utility into a state…

17 thms1 active userReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Comparison Between Mean-Variance and Monotone Mean-Variance Preferences Under Jump Diffusion and Stochastic Factor Model: Optimal MMV and MV Utilities Coincide If and Only If Assumption 1 HoldsResearch Paper

Mean-variance (MV) preferences, Uθ(X)=E[X]−θ2Var(X)U_\theta(X)=\mathbb E[X]-\frac\theta2\mathrm{Var}(X)Uθ​(X)=E[X]−2θ​Var(X), are the standard objective of portfolio selection since Markowitz. They are not monotone: an investor can prefer a terminal wealth XXX to a wealth X′≥XX'\ge XX′≥X that is larger in every state, because the extra upside raises the variance. Monotone mean-variance (MMV) preferences (Ma…

15 thms1 active userReviewed
Partial Differential EquationsStochastic Systems·Captain: mikedeng1

Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking: Verification Theorem for the Optimal Feedback Investment-Consumption StrategyResearch Paper

A fund manager who tracks a benchmark (a stock index, a price index, the cost of higher education) wants the managed wealth to stay above the benchmark at all times. Under a strict floor constraint Vt≥MtV_t\ge M_tVt​≥Mt​ the set of admissible strategies can be empty when the benchmark is random. Bo, Huang and Yu (arXiv:2302.08302, Math. Oper. Res.) relax the…

22 thms1 active userReviewed
PreviousPage 4 of 6Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me