1,862 results for optima · 0.114s

arxiv.org/abs/0909.4948v3

Optimal Stopping for Dynamic Convex Risk Measures

We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an equivalent zero-...

arxiv.org/abs/1505.07533v3

Optimal Stopping with Random Maturity under Nonlinear Expectations

We analyze an optimal stopping problem with random maturity under a nonlinear expectation with respect to a weakly compact set of mutually singular probabilities $\mathcal{P}$. The maturity is specified as the hitting time to level $0$ of some contin...

Sponsored Partners
arxiv.org/abs/1803.07696v4

Inverse Optimal Control from Incomplete Trajectory Observations

This article develops a methodology that enables learning an objective function of an optimal control system from incomplete trajectory observations. The objective function is assumed to be a weighted sum of features (or basis functions) with unknown...

arxiv.org/abs/2505.00893v2

Optimal Syntactic Definitions of Back-and-Forth Types

The back-and-forth relations $M\leq_αN$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_αN\}$ is (lightface) $Π^0_{2α}$. We show that this is optimal as the set is $\math...

arxiv.org/abs/2009.02513v4

A control theory approach to optimal pandemic mitigation

In the framework of homogeneous susceptible-infected-recovered (SIR) models, we use a control theory approach to identify optimal pandemic mitigation strategies. We derive rather general conditions for reaching herd immunity while minimizing the cost...

arxiv.org/abs/quant-ph/9805019v2

Optimal eavesdropping in quantum cryptography with six states

A generalization of the quantum cryptographic protocol by Bennett and Brassard is discussed, using three conjugate bases, i.e. six states. By calculating the optimal mutual information between sender and eavesdropper it is shown that this scheme is...

arxiv.org/abs/2509.10471v1

Bluffing in Scrabble

It is well known that in games with imperfect information, such as poker, bluffing with some probability can be a component of the optimal strategy. However, as far as we know, nobody has ever exhibited a Scrabble position in which the optimal strate...

arxiv.org/abs/2510.03861v1

Calm local optimality for couple-constrained minimax problems

Recently, a new local optimality concept for minimax problems, termed calm local minimax points, has been introduced. In this paper, we extend this concept to a general class of nonsmooth, nonconvex nonconcave minimax problems with coupled constraint...

arxiv.org/abs/2306.17443v1

Calm local optimality for nonconvex-nonconcave minimax problems

Nonconvex-nonconcave minimax problems have found numerous applications in various fields including machine learning. However, questions remain about what is a good surrogate for local minimax optimum and how to characterize the minimax optimality. Re...

arxiv.org/abs/1910.12516v2

Robust Contracting in General Contract Spaces

We consider a general framework of optimal mechanism design under adverse selection and ambiguity about the type distribution of agents. We prove the existence of optimal mechanisms under minimal assumptions on the contract space and prove that centr...

arxiv.org/abs/2208.03708v1

Optimal Tracking in Prediction with Expert Advice

We study the prediction with expert advice setting, where the aim is to produce a decision by combining the decisions generated by a set of experts, e.g., independently running algorithms. We achieve the min-max optimal dynamic regret under the predi...