Guessing Under Source Uncertainty

We study the problem of guessing the realization of a finite alphabet source, when the only knowledge available about the source is that it belongs to a (finite or infinite) family. We identify good guessing strategies that minimize the supremum redundancy (over the family) due to mismatch, and identify this min-sup value.