Weighted Garbling
Daehyun Kim, Ichiro Obara
TL;DR
An information order on experiments based on weighted garbling is introduced, a generalization of the standard notion of garbling that is equivalent to ordinary garbling conditional on a payoff-irrelevant event and characterized in terms of induced posterior belief distributions, showing that it depends only on their support.
Abstract
We introduce an information order on experiments based on weighted garbling, a generalization of the standard notion of garbling. In this order, an experiment is more informative than another if the latter is a weighted garbling of the former. We show that this is equivalent to ordinary garbling conditional on a payoff-irrelevant event. We also characterize the order in terms of induced posterior belief distributions, showing that it depends only on their support. Our main results provide two decision-theoretic characterizations of this order. First, in static decision problems, one experiment dominates another if and only if its value of information is at least a fixed fraction of the other's across all problems. Second, in a class of stopping time problems with a hidden Markov process and repeated experimentation, one experiment dominates another if and only if it yields weakly higher expected payoffs for every problem with a regular prior.
