On the definition of solution to the total variation flow

We show that the notions of weak solution to the total variation flow based on the Anzellotti pairing and the variational inequality coincide under some restrictions on the boundary data. The key ingredient in the argument is a duality result for the total variation functional, which is based on an approximation of the total variation by area-type functionals.

A variational inequality arising from optimal surrender of variable annuity with lookback benefit

We introduce a variable annuity (VA) contract with a surrender option and lookback benefit, that is, the benefit of the VA contract is linked to the maximum process of the policyholder’s account value. In contrast to the constant guarantee model provided in Bernard et al. (Insur. Math. Econ. 55:116–128, 2014), it is optimal for the policyholder of the VA contract with lookback benefit to surrender the VA contract when the policyholder’s account value is below or equal to the optimal surrender boundary. Thus, from the perspective of the insurer to construct a portfolio of VA contracts, utilizing the VA contracts with lookback benefit along with VA contracts with constant guarantee provides the diversification of early surrenders. The valuation of this contract can be described as a two-dimensional parabolic variational inequality. By converting this into the one-dimensional problem, we obtain the integral equations for the value function and the free boundary. The recursive integration method is applied to obtain the numerical solutions. We also provide comparative statics of the optimal surrender boundaries with respect to various parameters.

An Iterative Method for Solving Split Monotone Variational Inclusion Problems and Finite Family of Variational Inequality Problems in Hilbert Spaces

The purpose of this paper is to study the convergence analysis of an intermixed algorithm for finding the common element of the set of solutions of split monotone variational inclusion problem (SMIV) and the set of a finite family of variational inequality problems. Under the suitable assumption, a strong convergence theorem has been proved in the framework of a real Hilbert space. In addition, by using our result, we obtain some additional results involving split convex minimization problems (SCMPs) and split feasibility problems (SFPs). Also, we give some numerical examples for supporting our main theorem.

Bounding the Inefficiency of the Multiclass, Multicriteria C-Logit Stochastic User Equilibrium in a Transportation Network

We derive the exact inefficiency upper bounds of the multiclass C-Logit stochastic user equilibrium (CL-SUE) in a transportation network. All travelers are classified on the basis of different values of time (VOT) into M classes. The multiclass CL-SUE model gives a more realistic path choice probability in comparison with the logit-based stochastic user equilibrium model by considering the overlapping effects between paths. To find efficiency loss upper bounds of the multiclass CL-SUE, two equivalent variational inequalities for the multiclass CL-SUE model, i.e., time-based variational inequality (VI) and monetary-based VI, are formulated. We give four different methods to define the inefficiency of the multiclass CL-SUE, i.e., to compare multiclass CL-SUE with multiclass system optimum, or to compare multiclass CL-SUE with multiclass C-Logit stochastic system optimum (CL-SSO), under the time-based criterion and the monetary-based criterion, respectively. We further investigate the effects of various parameters which include the degree of path overlapping (the commonality factor), the network complexity, degree of traffic congestion, the VOT of user classes, the network familiarity, and the total demand on the inefficiency bounds.