Search arXiv⌕ Search

arXiv subjects

Erhan Bayraktar

Publications and source records attributed to Erhan Bayraktar.

At least 19 recordsLinked to original sources

Prediction with Five Experts and Geometric Stopping: A Probabilistic Construction and Analytic Verification

We present a solution of the limiting five-expert prediction problem with geometric stopping, based on stochastic calculus and partial differential equations. If $δ$ is the stopping probability, the minimax expected regret from tied initial scores is $45π^2/(512\sqrt{2δ})+o(δ^{-1/2})$ as $δ\downarrow0$. The adversarial rank control selecting the best and third-best experts maximizes the limiting Hamiltonian at every state. Following the four-expert construction of Bayraktar, Ekren, and Zhang (2020), we represent the value correction as a discounted boundary-local-time expectation for a degenerate obliquely reflected Brownian motion. The hyperbolic systems governing its boundary traces are derived and solved explicitly. To verify the nonlinear Hamilton--Jacobi--Bellman equation, we combine heat-equation minimum principles in equality directions, ODE minimum principles applied to convex combinations of multiple controls, and comparisons across controls. These arguments reduce the 48 regional control inequalities to a few lower-dimensional boundary problems, with the remaining signs established by explicit monotonicity arguments and by factorization of multivariate integral kernels that are positive polynomials in some of their variables. We prove global $C^2$ regularity across both regional interfaces and changes in rank ordering. We also show that the alternating COMB control only attains the limiting Hamiltonian maximum exactly when the two highest scores coincide and the third- and fourth-highest scores coincide.

math.OC↗

Kinetic Mean-Field Planning via Schrödinger Bridges: Existence, Penalization, and Consistency Bounds

We study a mean-field planning problem for a swarm of interacting, non-cooperative agents whose dynamics are stochastic and kinetic. The noise acts on the velocity only, and the interaction (of Cucker-Smale type for instance) enters through the drift. For a fixed flow, the problem reduces to a Schrödinger bridge problem, and we first prove the existence of an equilibrium by a Schauder fixed-point argument. Then we replace the hard terminal constraint by a penalty function and show that equilibria of the penalized problems converge, along subsequences, to an equilibrium of the original problem. Since equilibria are not unique in general, we instead quantify the consistency error, which measures how far an equilibrium of the penalized problem is from being an equilibrium of the original one. The rate is of order $n^{-1/2}$ for the relative-entropy penalty. The proof relies on the quantitative stability of entropic optimal transport and on a pointwise linear growth bound on the score of the degenerate reference dynamics, which is of independent interest.

math.PR↗

The end-of-month option in futures contracts and the Gittins index of holding the underlying

The end-of-month option allows the short in a futures contract to choose when to deliver during a window in which the delivery price is fixed. We characterize optimal delivery through a universal index obtained from the Bank--El Karoui representation theorem. In the semimartingale setting, this is the Gittins index of holding the underlying and collecting its convenience yield, and the futures price is the retirement reward for which the value of this project equals the spot price. This characterization yields price bounds and a criterion for immediate delivery. Dinkelbach's iteration reduces the price computation to a sequence of standard optimal stopping problems, with an explicit contraction bound. We apply the theory to geometric Brownian motion and the Gibson--Schwartz model with stochastic convenience yield. For geometric Brownian motion, we characterize when the futures price equals spot and derive a square-root boundary asymptotic near expiry. For the Gibson--Schwartz model, we establish monotonicity in the yield and characterize the critical yield below which the price equals spot. Numerical results illustrate the price iteration and delivery regions.

q-fin.MF↗

Target-Generated Dirichlet Problems in State-Constrained Stochastic Control

We study state-constrained stochastic control problems with a scalar surplus $R \geq 0$. Controls for which the drift and volatility of $R$ vanish at zero define a lower-dimensional Hamilton-Jacobi-Bellman equation. Starting from control-wise state-constraint viscosity inequalities, we prove that the upper and lower limits of the interior value are a subsolution and a supersolution of this boundary equation. Terminal compatibility and comparison identify their common limit. We require one-sided bounds on positive surplus drift and generator growth, together with domination by boundary generators. For compact or coercive controls, these follow from a local lower bound and continuity of the boundary control set. For a smooth stochastic target value $w$, the transformation $R = Y - w(t,X)$ flattens the viable epigraph, and, under the stated hypotheses, the boundary control value supplies the Dirichlet datum. Applications include set-valued boundary controls, unbounded drift with quadratic costs, and redundant hedging instruments with a nonconstant target boundary.

math.OC↗

Ergodicity and turnpike properties of linear-quadratic mean field control problems

We study the asymptotic behavior of solutions to linear-quadratic mean field stochastic optimal control problems. By formulating an ergodic control framework, we characterize the convergence between the finite time horizon control problem and its ergodic counterpart. Leveraging these convergence results, we establish the turnpike property for the optimal pairs, demonstrating that solutions to the finite time horizon control problem remain exponentially close to the ergodic equilibrium except near the temporal boundaries. This result reveals the intrinsic connection between long-term dynamics and their asymptotic behavior in mean field control systems.

math.OC↗

A one-sided constrained martingale transport between two uniform laws

We minimize $\mathbb E[h(Y-X)]$ over martingale couplings of $\text{Unif}[-1,1]$ and $\text{Unif}[-2,2]$ satisfying $Y\geq X-k$, where $h\in C^1([-3,3])$ has convex derivative. Feasibility holds exactly for $k\geq1$. For each such $k$, we construct a coupling that minimizes all costs in this class. For $1<k<3$, its support consists of two graphs, with $D(x)=x-k$ on $[k-2,1]$. The maps admit an explicit parametrization for $2\leq k<3$ and are determined by scalar equations with unique admissible roots for $1<k<2$. We prove optimality by a dual inequality, using an analytic estimate in the latter range. At $k=1$ the optimizer is $Y=X\pm1$ with equal probabilities; for $k\geq3$ it is the ordinary left-curtain coupling. In the unconstrained problem, left-monotonicity identifies the left-curtain coupling, which is optimal for this cost class. Under the constraint, a discrete example shows that the corresponding support condition, even together with every two-source comparison, does not imply optimality.

math.PR↗

Viscosity and minimax solutions for path-dependent Hamilton-Jacobi equations in infinite dimensions and related differential games

We establish new results for path-dependent Hamilton-Jacobi equations with nonlinear monotone, and coercive operators on Hilbert space, which were initially studied in Bayraktar and Keller [J. Funct. Anal., 275 (8) (2018), pp. 2096-2161]. Under more general assumptions than in the cited paper (and more general than in the finite-dimensional case as well), we prove the uniqueness of a minimax solution of a terminal-value problem for the equation under consideration and the existence of such a solution on the whole path space. We introduce a new notion of a viscosity solution for this problem and show the equivalence of this notion to the notion of a minimax solution, which implies the corresponding existence and uniqueness theorem for viscosity solutions. In addition, we obtain a stability result for viscosity solutions using the half-relaxed limits method. As applications, we prove two theorems on the existence and characterization of value of a zero-sum differential game for a time-delay (path-dependent) evolution equation. The first theorem pertains to the case of non-anticipative (Elliott-Kalton) strategies and is related to the results on viscosity solutions, and the second theorem deals with the case of feedback (Krasovskii-Subbotin) strategies and is based on the results on minimax solutions.

math.AP↗

Convergence of implicit schemes for Hamilton-Jacobi-Bellman quasi-variational inequalities

In [Azimzadeh, P., and P. A. Forsyth. "Weakly chained matrices, policy iteration, and impulse control." SIAM J. Num. Anal. 54.3 (2016): 1341-1364], we outlined the theory and implementation of computational methods for implicit schemes for Hamilton-Jacobi-Bellman quasi-variational inequalities (HJBQVIs). No convergence proofs were given therein. This work closes the gap by giving rigorous proofs of convergence. We do so by introducing the notion of nonlocal consistency and appealing to a Barles-Souganidis type analysis. Our results rely only on a well-known comparison principle and are independent of the specific form of the intervention operator.

math.NA↗

High order Bellman equations and weakly chained diagonally dominant tensors

We introduce high order Bellman equations, extending classical Bellman equations to the tensor setting. We introduce weakly chained diagonally dominant (w.c.d.d.) tensors and show that a sufficient condition for the existence and uniqueness of a positive solution to a high order Bellman equation is that the tensors appearing in the equation are w.c.d.d. M-tensors. In this case, we give a policy iteration algorithm to compute this solution. We also prove that a weakly diagonally dominant Z-tensor with nonnegative diagonals is a strong M-tensor if and only if it is w.c.d.d. This last point is analogous to a corresponding result in the matrix setting and tightens a result from [L. Zhang, L. Qi, and G. Zhou. "M-tensors and some applications." SIAM Journal on Matrix Analysis and Applications (2014)]. We apply our results to obtain a provably convergent numerical scheme for an optimal control problem using an "optimize then discretize" approach which outperforms (in both computation time and accuracy) a classical "discretize then optimize" approach. To the best of our knowledge, a link between M-tensors and optimal control has not been previously established.

math.RA↗

Mean-Field PhiBE: Continuous-Time Mean-Field Reinforcement Learning from Discrete-Time Data

This paper develops a model-free framework for continuous-time mean-field control when the population evolves according to unknown controlled McKean--Vlasov dynamics and only discrete-time transition data are available. Model-based mean-field control requires the continuous-time drift and diffusion coefficients, which are not directly observed from fixed-step transitions, while a direct reduction to a discrete-time Bellman equation loses the continuous-time generator structure. To bridge these two viewpoints, we introduce a Mean-Field-PhiBE (MF-PhiBE), which incorporates discrete-time transition information into a continuous-time PDE on the Wasserstein space. The MF-PhiBE replaces the unknown infinitesimal drift and covariance in the policy-evaluation equation by one-step estimators computed from data, while preserving the generator structure of the McKean-Vlasov HJB equation. We also derive a policy-gradient theorem for entropy-regularized randomized feedback policies, expressing the actor direction through an action-wise infinitesimal advantage and the score of the policy. Combining these two ingredients yields a model-free actor-critic method. We prove a first-order consistency estimate showing that the value induced by an optimal MF-PhiBE policy approximates the optimal continuous-time value as the observation time step vanishes. For entropy-regularized LQR, we establish first-order policy convergence and second-order value convergence; under suitable conditions, the population-averaged feedback means coincide exactly. Numerical experiments on an LQR benchmark and a crowd-aversion problem illustrate the proposed framework.

math.OC↗

Convex order and preservation of convexity for Bayesian posterior updates

We study how the response of a Bayesian posterior statistic to future observations changes as information accumulates. For a non-decreasing function $T$, define $Π_n^T=\E[T(Θ)\vert \mathcal F_n]$, where $Θ$ has an arbitrary prior and the observations come from a one-parameter exponential family. Conditioning on the same current value of $Π^T$, we show that the posterior statistic after additional observations is larger in convex order when the current posterior is based on fewer observations. We also prove preservation of convexity: the expected value of a convex function of the future posterior statistic is convex in the current posterior statistic. Together, these two properties provide structural tools for establishing time-monotonicity results in dynamic Bayesian decision and optimal stopping problems. If the exponential family contains an infinitely divisible distribution, the results extend to a continuous-time observation model through a family of Lévy processes.

math.ST↗

Mean-field optimal stopping with endogenous quantile cutoffs

We study a mean-field optimal stopping problem with an endogenous population-level shutdown. All remaining agents stop when the survival mass falls below a prescribed threshold. We recast the discontinuous objective as the singular, nonconvex constraint that the survival mass lie in $\{0\}\cup[α,1]$. We prove the equivalence of strong and weak values via an approximation and the existence of an optimal rule via compactness and penalization. We also prove a dynamic programming principle. The value is continuous away from the critical boundary but may be discontinuous at the boundary itself. Under strict initial feasibility, finite-population values converge to the mean-field value. In the same regime, the laws of near-optimal empirical measures are tight and every mean-field optimizer admits a recovery sequence. At the threshold, however, finite-population convergence may fail.

math.OC↗

Tractable bank capital structure: optimal control under Basel III constraints

Banks must optimize risky investments, dividend payouts, and capital structure under tight Basel III solvency and liquidity constraints, while costly equity issuance serves as a distress-recovery tool. We formulate this as a stochastic control problem that reduces the high-dimensional balance-sheet dynamics to a tractable one-dimensional process in the asset-to-deposit ratio, with state-dependent investment limits. The resulting policy is simple and interpretable: pay dividends at an upper reflection barrier and, when needed, recapitalize only at the distress boundary, jumping to an optimal target level. We characterize these thresholds analytically and show their sensitivity to regulatory parameters. From a regulatory viewpoint, we use Monte Carlo simulation to solve an outer optimization problem and map the efficient frontier between shareholder value and survival probability, both with and without a leverage cap. In the illustrative parameter ranges studied here, tightening solvency requirements often yields the best safety--profitability trade-off.

math.OC↗

On hypoellipticity of degenerate operators in testing and detection problems

We study a class of degenerate diffusion generators arising in sequential testing and quickest detection problems with partial information. The observation process is driven by $k$ independent Brownian motions, while the hidden state takes $n+1$ values, with $k<n$. After transforming to posterior likelihood coordinates, we analyze Hörmander's condition both in the absence of state switching (testing) and in its presence (detection). We characterize hypoellipticity in the testing case and give explicit sufficient conditions in the detection case. We further study the stationary posterior operator, its parabolic extension, the joint observation-posterior operator, and its parabolic extension; their Hörmander conditions need not coincide. We characterize the relationships among these operators under our main structural regimes and discuss their probabilistic consequences and the regularity of the associated optimal stopping problem.

math.ST↗

Kullback-Leibler Mirror-Prox for Measure-Valued Variational Inequalities and Mean-Field Equilibria

We study the computation of static mean-field equilibria on a compact state space by formulating the equilibrium condition as a variational inequality over probability measures. We propose an entropic variant of Korpelevich's extragradient algorithm---the Kullback--Leibler Mirror-Prox method---in which Euclidean projections are replaced by relative-entropy proximal steps. Each half-step is therefore an explicit exponential reweighting of the current measure, implemented on a finite state-space discretization. Under Lasry--Lions monotonicity and continuity assumptions, we prove convergence of mesh-refined ergodic averages and obtain finite-iteration Minty-residual and approximate-equilibrium bounds that jointly quantify iteration and discretization errors. Under strong monotonicity, we derive metric convergence rates for the last, best, and averaged iterates. We also develop a KL-type Tikhonov regularization that selects the equilibrium minimizing relative entropy with respect to a reference measure. The framework applies to potential and nonpotential cost operators and does not require differentiability or convexity of the cost in the individual state.

math.OC↗

Mean-Field Doubly Reflected Forward-Backward SDEs with Optional Barriers and $L^p$-Data

We study mean-field doubly reflected forward-backward stochastic differential equations with two optional barriers satisfying a strong Mokobodzki condition. For $L^p$-data, $p\in(1,2]$, we prove existence and uniqueness on sufficiently short time horizons when the coefficients may depend on the joint law of $(X,Y,Z)$. Under an additional monotonicity condition and using an exponentially weighted norm, we also obtain a global-in-time result for $p=2$. The setting is motivated by recursive mean-field Dynkin games and game-option valuation with irregular payoff barriers.

math.PR↗

Uniform-in-time convergence and turnpike properties of linear-quadratic mean field control problems with common noise

We investigate uniform-in-time convergence and turnpike properties for linear-quadratic mean field control problems with common noise. Within a unified framework, we analyze a finite-horizon social optimization problem, its mean field control limit, and the corresponding ergodic mean field control problem. The finite-horizon problems are characterized by coupled Riccati differential equations, whereas the ergodic problem is addressed via a Bellman equation on the Wasserstein space, which reduces to a system of stabilizing algebraic Riccati equations. By deriving estimates for these Riccati systems, we establish a turnpike property for the finite-horizon mean field control problem and obtain quantitative convergence results from the social optimization problem to its mean field limit and the associated ergodic control problem.

math.OC↗

Infinite Horizon Optimal Consumption: Intertemporal Hedging under Epstein-Zin Preferences

We study an infinite-horizon optimal consumption-investment problem for an investor with Epstein-Zin stochastic differential utility in an incomplete market with stochastic investment opportunities. Risk aversion and intertemporal substitution are separated, and we work in the regime $θ\in(0,1)$, where there exists a unique generalised utility process for arbitrary non-negative progressively measurable consumption streams. Our main contribution is a variational characterisation of the value function. We show that the value function is the unique minimiser of a functional whose Euler-Lagrange equation coincides with the Hamilton-Jacobi-Bellman equation. Although the functional may be non-convex, the direct method yields existence, and we prove that every minimiser is a strictly positive, bounded classical solution. A verification theorem identifies any minimiser with the value function and gives feedback representations for optimal consumption and investment policies. The proof combines a change of measure to the myopic probability with uniqueness results for Epstein-Zin BSDEs and a perturbation argument for optimality. Examples with stochastic volatility, Gaussian excess returns, and fat-tailed excess returns illustrate the scope of the framework and its implications for intertemporal hedging.

q-fin.MF↗