We show that in an equity market model with Knightian uncertainty regarding the relative risk and covariance structure of its assets, the arbitrage function -- defined as the reciprocal of the highest return on investment that can be achieved relative to the market using nonanticipative strategies, and under any admissible market model configuration -- is a viscosity solution of an associated Hamilton-Jacobi-Bellman (HJB) equation under appropriate boundedness, continuity and Markovian assumptions on the uncertainty structure. This result generalizes that of Fernholz and Karatzas (2011), who characterized this arbitrage function as a classical solution of a Cauchy problem for this HJB equation under much stronger conditions than those needed here.
Given a controlled stochastic process, the reachability set is the collection of all initial data from which the state process can be driven into a target set at a specified time. Differential properties of these sets are studied by the dynamic programming principle which is proved by the Jankov-von Neumann measurable selection theorem. This principle implies that the reachability sets satisfy a geometric partial differential equation, which is the analogue of the Hamilton-Jacobi-Bellman equation for this problem. By appropriately choosing the controlled process, this connection provides a stochastic representation for mean curvature type geometric flows. Another application is the super-replication problem in financial mathematics. Several applications in this direction are also discussed.  We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical difficulties related to the measurable selection argument. In the Markov case, our result is tailor-made for the derivation of the dynamic programming equation in the sense of viscosity solutions. The optimal control problem where the state is governed by an Ito stochastic differential equation (possibly just an ordinary differential equation) is formulated in martingale terms. Under a coercivity condition (which is weaker than compactness of the control set), a convexity condition, and mild continuity hypotheses on the data, it is shown by the direct method that optimal controls exist. Hard and soft constraints are allowed. In the absence of soft constraints it is shown that there exists an optimal control that is a function only of the present time and state, i.e., the synthesis problem has a solution. The main tool here is Krylov’s Markovian Selection Theorem.