Hiding and Covering in a Compact Metric Space

McEliece, Robert J.; Posner, Edward C.

Ann. Statist., Tome 1 (1973) no. 2, p. 729-739 / Harvested from Project Euclid

Résumé

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 \nu_L^\ast, \nu_L^\ast$ being the lower value of a game on $X$ we call "restricted hide and seek."

Publié le : 1973-07-14
Classification:

@article{1176342467,
     author = {McEliece, Robert J. and Posner, Edward C.},
     title = {Hiding and Covering in a Compact Metric Space},
     journal = {Ann. Statist.},
     volume = {1},
     number = {2},
     year = {1973},
     pages = { 729-739},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176342467}
}

McEliece, Robert J.; Posner, Edward C. Hiding and Covering in a Compact Metric Space. Ann. Statist., Tome 1 (1973) no. 2, pp.  729-739. http://gdmltest.u-ga.fr/item/1176342467/