Value of Persistent Information
We consider the value of persistent information in strictly competitive situations, formalized as stochastic zero-sum games where only the maximizer ob-serves the state that evolves according to an ergodic Markov operator. We say that operator Q is better for the maximizer than operator P if the value of the game under Q is higher than under P regardless of the stage game. We show that this defines a partial order on the space of ergodic Markov operators, and provide a full characterization of this partial order. An i.i.d. state is the best case for the informed player; however, a perfectly persistent state is not necessarily the worst case. The analysis relies on a novel characterization of the value of a stochastic game with incomplete information. Our results can alternatively be interpreted as pertaining to the limit of the minmax value in repeated Bayesian games with Markov types. 1.