SearcharxivSearch

arXiv · 1304.6986

On the Masami Yasuda stopping game

Abstract

The sero-sum stopping game for the stochastic sequences has been formulated in late sixties of the twenty century by Dynkin (1969). The formulation had the assumption about separability of decision moment of the players which simplified the construction of the solution. Further research by Neveu (1975) extended the model by admitting more general behaviour of the players and their pay--offs. In new formulation there is the problem with existence of the equilibrium. The proper approach to solution of the problem without restriction of former models was developed by Yasuda (1975). The results was crucial in these research. The author made often reference to the Yasuda's (1985) result in his works (see the author's papers (1993,1995)) as well as see results of others stimulated by this paper. Withal, in this note another stopping game model, developed by Yasuda with coauthors (see e.g. Kurano at al. (1980) and the author and Yasuda (1995)) is recalled. The application of the model to an analysis of system of detectors shows the power of the game theory methods. In the last part of the paper I would like to express my personal relation to the Masami Yasuda game.

Explore related subjects

Keep this discovery

BibTeXRIS

Krzysztof J. Szajowski. 2013-04-25. On the Masami Yasuda stopping game. https://arxiv.org/abs/1304.6986

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