Related papers: Maximizing functionals of the maximum in the Skoro…
We consider the problem of optimal multi-modes switching in finite horizon, when the state of the system, including the switching cost functions are arbitrary ($g_{ij}(t,x)\geq 0$). We show existence of the optimal strategy, and give when…
We study optimal stopping problems related to the pricing of perpetual American options in an extension of the Black-Merton-Scholes model in which the dividend and volatility rates of the underlying risky asset depend on the running values…
This paper studies convergence properties of optimal values and actions for discounted and average-cost Markov Decision Processes (MDPs) with weakly continuous transition probabilities and applies these properties to the stochastic…
This paper introduces a version of the argmax continuous mapping theorem that applies to M-estimation problems in which the objective functions converge to a limiting process with multiple maximizers. The concept of the smallest maximizer…
The Skorokhod Embedding problem is well understood when the underlying process is a Brownian motion. We examine the problem when the underlying is the simple symmetric random walk and when no external randomisation is allowed. We prove that…
Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…
Two maximization problems of R\'enyi entropy rate are investigated: the maximization over all stochastic processes whose marginals satisfy a linear constraint, and the Burg-like maximization over all stochastic processes whose…
Optimisation problems in science and engineering typically involve finding the ground state (i.e. the minimum energy configuration) of a cost function with respect to many variables. If the variables are corrupted by noise then this…
An instance $I$ of the Stable Matching Problem (SMP) is given by a bipartite graph with a preference list of neighbors for every vertex. A swap in $I$ is the exchange of two consecutive vertices in a preference list. A swap can be viewed as…
Previous authors have considered optimal stopping problems driven by the running maximum of a spectrally negative L\'evy process $X$, as well as of a one-dimensional diffusion. Many of the aforementioned results are either implicitly or…
This paper concerns optimal stopping problems driven by the running maximum of a spectrally negative L\'{e}vy process $X$. More precisely, we are interested in modifications of the Shepp-Shiryaev optimal stopping problem [Avram, Kyprianou…
In this paper, we study a maximization and a minimization problem associated with a Poisson boundary value problem. Optimal solutions in a set of rearrangements of a given function define stationary and stable flows of an ideal fluid in two…
We study the optimal investment stopping problem in both continuous and discrete case, where the investor needs to choose the optimal trading strategy and optimal stopping time concurrently to maximize the expected utility of terminal…
Many multiagent tasks -- such as reviewer assignment, coalition formation, or fair resource allocation -- require selecting a group of agents such that collaboration remains effective even in the worst case. The \emph{weighted max-min…
We complete the literature on the statistical mechanics of point vortices in two-dimensional hydrodynamics. Using a maximum entropy principle, we determine the multi-species Boltzmann-Poisson equation and establish a form of virial theorem.…
We consider a pair $(X,Y)$ of stochastic processes satisfying the equation $dX=a(X)Y\,dB$ driven by a Brownian motion and study the monotonicity and continuity in $y$ of the value function $v(x,y)=\sup_{\tau}E_{x,y}[e^{-q\tau}g(X_{\tau})]$,…
In this Note we study optimal stopping problems for strong Markov processes and affine functions. We give a justification of the Snell envelope form using standard results of optimal stopping. We also justify the convexity of the value…
This paper investigates the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for solving monotone variational inequality problems. The exact worst case convergence rate is computed using the performance…
For moving average processes with random coefficients and heavy-tailed innovations that are weakly dependent in the sense of strong mixing and local dependence condition $D'$ we study joint functional convergence of partial sums and maxima.…
The Skorokhod Embedding Problem (SEP) is one of the classical problems in the study of stochastic processes, with applications in many different fields (cf.~ the surveys \cite{Ob04,Ho11}). Many of these applications have natural…