Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userApproximation of A Class of Non-Zero-Sum Investment and Reinsurance Games for Regime-Switching Jump-Diffusion Models
118
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This work develops an approximation procedure for a class of non-zero-sum stochastic differential investment and reinsurance games between two insurance companies. Both proportional reinsurance and excess-of loss reinsurance policies are considered. We develop numerical algorithms to obtain the Nash equilibrium by adopting the Markov chain approximation methodology and applying the dynamical programming principle for the nonlinear integro-differential Hamilton-Jacobi-Isaacs (HJI) equations. Furthermore, we establish the convergence of the approximation sequences and the approximation to the value functions. Numerical examples are presented to illustrate the applicability of the algorithms.
rate research
Read More
This work develops asymptotic properties of a class of switching jump diffusion processes. The processes under consideration may be viewed as a number of jump diffusion processes modulated by a random switching mechanism. The underlying processes feature in the switching process depends on the jump diffusions. In this paper, conditions for recurrence and positive recurrence are derived. Ergodicity is examined in detail. Existence of invariant probability measures is proved.
This paper presents the solution to a European option pricing problem by considering a regime-switching jump diffusion model of the underlying financial asset price dynamics. The regimes are assumed to be the results of an observed pure jump process, driving the values of interest rate and volatility coefficient. The pure jump process is assumed to be a semi-Markov process on finite state space. This consideration helps to incorporate a specific type of memory influence in the asset price. Under this model assumption, the locally risk minimizing price of the European type path-independent options is found. The F{o}llmer-Schweizer decomposition is adopted to show that the option price satisfies an evolution problem, as a function of time, stock price, market regime, and the stagnancy period. To be more precise, the evolution problem involves a linear, parabolic, degenerate and non-local system of integro-partial differential equations. We have established existence and uniqueness of classical solution to the evolution problem in an appropriate class.
We study a wide class of non-convex non-concave min-max games that generalizes over standard bilinear zero-sum games. In this class, players control the inputs of a smooth function whose output is being applied to a bilinear zero-sum game. This class of games is motivated by the indirect nature of the competition in Generative Adversarial Networks, where players control the parameters of a neural network while the actual competition happens between the distributions that the generator and discriminator capture. We establish theoretically, that depending on the specific instance of the problem gradient-descent-ascent dynamics can exhibit a variety of behaviors antithetical to convergence to the game theoretically meaningful min-max solution. Specifically, different forms of recurrent behavior (including periodicity and Poincare recurrence) are possible as well as convergence to spurious (non-min-max) equilibria for a positive measure of initial conditions. At the technical level, our analysis combines tools from optimization theory, game theory and dynamical systems.
We conduct a local non-asymptotic analysis of the logistic fictitious play (LFP) algorithm, and show that with high probability, this algorithm converges locally at rate $O(1/t)$. To achieve this, we first develop a global non-asymptotic analysis of the deterministic variant of LFP, which we call DLFP, and derive a class of convergence rates based on different step-sizes. We then incorporate a particular form of stochastic noise to the analysis of DLFP, and obtain the local convergence rate of LFP. As a result of independent interest, we extend DLFP to solve a class of strongly convex composite optimization problems. We show that although the resulting algorithm is a simple variant of the generalized Frank-Wolfe method in Nesterov [1,Section 5], somewhat surprisingly, it enjoys significantly improved convergence rate.
This paper studies Mean Field Games with a common noise given by a continuous time Markov chain under a Quadratic cost structure. The theory implies that the optimal path under the equilibrium is a Gaussian process conditional on the common noise. Interestingly, it reveals the Markovian structure of the random equilibrium measure flow, which can be characterized via a deterministic finite dimensional system.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
