Borel games with incomplete information on one side

We prove that the maxmin value of two-player zero-sum repeated games with incomplete information on one side, where the payoff function is tail measurable (and not necessarily the long-run average payoff) is equal to the concavification of the value function of the non-revealing game. We provide an example which demonstrates that the value need not exist when the payoff function is tail measurable.

Joint work with Gil Bar Castellon Koltun and Ehud Lehrer.