The source coding game with a cheating switcher
<|reference_start|>The source coding game with a cheating switcher: Berger's paper `The Source Coding Game', IEEE Trans. Inform. Theory, 1971, considers the problem of finding the rate-distortion function for an adversarial source comprised of multiple known IID sources. The adversary, called the `switcher', was allowed only causal access to the source realizations and the rate-distortion function was obtained through the use of a type covering lemma. In this paper, the rate-distortion function of the adversarial source is described, under the assumption that the switcher has non-causal access to all source realizations. The proof utilizes the type covering lemma and simple conditional, random `switching' rules. The rate-distortion function is once again the maximization of the R(D) function for a region of attainable IID distributions.<|reference_end|>
@article{palaiyanur2007the,
    title={The source coding game with a cheating switcher},
    author={Hari Palaiyanur, Cheng Chang, and Anant Sahai},
    journal={arXiv preprint arXiv:cs/0701027},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0701027},
    primaryClass={cs.IT math.IT}
}