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.