A stochastic analog to Chebyshev centers and optimal average case algorithms

https://doi.org/10.1016/0885-064X(89)90013-7Get rights and content
Under an Elsevier user license
open archive

Abstract

We study a stochastic analog to Chebyshev centers in a metric space. We prove several statements concerning the existence and uniqueness of those centers. Similarly as in the worst case these results can be used to prove the existence and uniqueness of optimal average case algorithms. We also show that nonmeasurable algorithms are not better than measurable ones.

Cited by (0)