SearcharxivSearch

arXiv · 1805.12035

Optimal dividends with partial information and stopping of a degenerate reflecting diffusion

Abstract

We study the optimal dividend problem for a firm's manager who has partial information on the profitability of the firm. The problem is formulated as one of singular stochastic control with partial information on the drift of the underlying process and with absorption. In the Markovian formulation, we have a 2-dimensional degenerate diffusion, whose first component is singularly controlled and it is absorbed as it hits zero. The free boundary problem (FBP) associated to the value function of the control problem is challenging from the analytical point of view due to the interplay of degeneracy and absorption. We find a probabilistic way to show that the value function of the dividend problem is a smooth solution of the FBP and to construct an optimal dividend strategy. Our approach establishes a new link between multidimensional singular stochastic control problems with absorption and problems of optimal stopping with `creation'. One key feature of the stopping problem is that creation occurs at a state-dependent rate of the `local-time' of an auxiliary 2-dimensional reflecting diffusion.

Explore related subjects

Keep this discovery

BibTeXRIS

Tiziano De Angelis. 2018-05-30. Optimal dividends with partial information and stopping of a degenerate reflecting diffusion. https://arxiv.org/abs/1805.12035

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR