arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.08162stat.OTmath.STstat.TH
收藏

德国坦克问题

Lessons from the German Tank Problem

George Clark, Alex Gonye, Steven J Miller

摘要:

在第二次世界大战期间,德国军队使用坦克来毁灭性的优势。盟军需要准确估计他们的坦克生产和部署。他们使用两种方法来找到这些值:间谍和统计数据。本说明介绍统计方法。假设储罐从1开始连续标记,如果我们从未知数量的储罐$N$中观察到$k$序列号,最大观察值为$m$,则$N$的最佳估计值为$m(1 + 1/k) - 1$。这个问题现在被称为德国坦克问题,是数学和统计学在现实世界中应用的一个很好的例子。论文的第一部分再现了已知的结果,特别是推导出这一估计,并将其有效性与间谍的有效性进行比较。第二部分给出了一个我们在其他地方没有找到的结果,推广到最小值不一定是1的情况。我们详细强调了为什么我们能够获得这种干净的,封闭形式的表达式的估计,并结束了一个附录,强调如何使用这个问题来教回归和统计如何帮助我们找到函数关系。

英文摘要:

During World War II the German army used tanks to devastating advantage. The Allies needed accurate estimates of their tank production and deployment. They used two approaches to find these values: spies, and statistics. This note describes the statistical approach. Assuming the tanks are labeled consecutively starting at 1, if we observe $k$ serial numbers from an unknown number $N$ of tanks, with the maximum observed value $m$, then the best estimate for $N$ is $m(1 + 1/k) - 1$. This is now known as the German Tank Problem, and is a terrific example of the applicability of mathematics and statistics in the real world. The first part of the paper reproduces known results, specifically deriving this estimate and comparing its effectiveness to that of the spies. The second part presents a result we have not found in print elsewhere, the generalization to the case where the smallest value is not necessarily 1. We emphasize in detail why we are able to obtain such clean, closed-form expressions for the estimates, and conclude with an appendix highlighting how to use this problem to teach regression and how statistics can help us find functional relationships.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑