An application of the method of finite Markov chain imbedding to runs tests
โ Scribed by W.Y. Wendy Lou
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 369 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
โฆ Synopsis
The method of finite Markov chain imbedding developed by Fu and Koutras (1994) has become a popular and useful tool for studying runs and patterns-related problems. In this article, their approach is used as an alternative for obtaining the exact conditional distribution of the success runs statistic given the number of successes in a sequence of n i.i.d. Bernoulli trials, which, in the past, was computed mainly from traditional combinatorics.
๐ SIMILAR VOLUMES
This paper presents an application of Lemke's method to a class of Markov decision problems, appearing in the optimal stopping problems, and other well-known optimization problems. We consider a special case of the Markov decision problems with ยฎnitely many states, where the agent can choose one of