SearcharxivSearch

arXiv · 2307.01623

A controller-stopper-game with hidden controller type

Abstract

We consider a continuous time stochastic dynamic game between a stopper (Player $1$, the \textit{owner} of an asset yielding an income) and a controller (Player $2$, the \textit{manager} of the asset), where the manager is either effective or non-effective. An effective manager can choose to exert low or high effort which corresponds to a high or a low positive drift for the accumulated income of the owner with random noise in terms of Brownian motion; where high effort comes at a cost for the manager. The manager earns a salary until the game is stopped by the owner, after which also no income is earned. A non-effective manager cannot act but still receives a salary. For this game we study (Nash) equilibria using stochastic filtering methods; in particular, in equilibrium the manager controls the learning rate (regarding the manager type) of the owner. First, we consider a strong formulation of the game which requires restrictive assumptions for the admissible controls, and find an equilibrium of (double) threshold type. Second, we consider a weak formulation, where a general set of admissible controls is considered. We show that the threshold equilibrium of the strong formulation is also an equilibrium in the weak formulation.

Explore related subjects

Keep this discovery

BibTeXRIS

Andi Bodnariu, Kristoffer Lindensjö. 2023-07-04. A controller-stopper-game with hidden controller type. https://arxiv.org/abs/2307.01623

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