Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Comparison of sequential and Neyman — Pearson criteria in the asymptotic case

  • 10 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    A. Dvoretzky, J. Kiefer, and J. Wolfowitz, “Sequential decision problems for processes with continuous time parameter,” Ann. Math. Stat.,24, No. 2 (1953).

  2. 2.

    A. Wald, Sequential Analysis, Wiley-Interscience (1947).

  3. 3.

    N. N. Lebedev, Special Functions and Their Applications [in Russian], GITTL, Moscow (1953).

  4. 4.

    R. A. Wijsman, “Uniqueness and monotonicity of sequential probability ratio tests,” Ann. Math. Stat.,34, No. 4 (1963).

Download references

Additional information

Translated from Kibernetika, No. 4, pp. 103–105, July–August, 1977.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Fal', A.M. Comparison of sequential and Neyman — Pearson criteria in the asymptotic case. Cybern Syst Anal 13, 582–584 (1977). https://doi.org/10.1007/BF01069556

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Asymptotic Case
  • Pearson Criterion