On information hiding with incomplete information about steganalysis

Suppose the information hider has a set of information hiding schemes to be employed in the presence of a set of steganalysis detectors. Let the information hider have only an incomplete information about the steganalysis detectors. That is, suppose the probability of the jth steganalysis detector would be used is p_j, j = 1,2...n, then the information hider only knows the ordering of these probabilities, say, p₁≥p₂≥...p_n. Under this circumstance how can the information hider choose the optimal embedding strategy? This is the question addressed in this paper. Theoretical analysis and some numerical results are presented.