You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Hiding and Covering in a Compact Metric Space
Robert J. McEliece and Edward C. Posner
The Annals of Statistics
Vol. 1, No. 4 (Jul., 1973), pp. 729-739
Published by: Institute of Mathematical Statistics
Stable URL: http://www.jstor.org/stable/2958316
Page Count: 11
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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 νL *, νL * being the lower value of a game on X we call "restricted hide and seek."
The Annals of Statistics © 1973 Institute of Mathematical Statistics