Hiding and Covering in a Compact Metric Space
Robert J. McEliece, Edward C. Posner · The Annals of Statistics · 1973
This paper studies the relationship between games of search on a compact metric space $X$ and the absolute epsilon entropy $I(X)$ of $X$. The main result is that $I(X) = -\log u_L^\ast, u_L^\ast$ being the lower value of a game on $X$ we call "restricted hide and seek."