Common

German tank problem

Problem in statistical estimation

German tank problem

Common card · No. 218839

In the statistical theory of estimation, the German tank problem consists of estimating the maximum of a discrete uniform distribution from sampling without replacement. In simple terms, suppose there exists an unknown number of items which are sequentially numbered from 1 to N. A random sample of these items is taken and their sequence numbers observed; the problem is to estimate N from these observed numbers. The problem can be approached using either frequentist inference or Bayesian inference, leading to different results. Estimating the population maximum based on a single sample yields divergent results, whereas estimation based on multiple samples is a practical estimation question whose answer is simple (especially in the frequentist setting) but not obvious (especially in the Bayesian setting). The problem is named after its historical application by Allied forces in World War II to estimate the monthly rate of German tank production from very limited data. The statistical method...

Read on Wikipedia · Image Hebenstreit, CC BY-SA 3.0 de

Open boosters, collect cards and trade them. Free to play.

Play for free
German tank problem – Common Wikipedia card | Wikiverse TCG