Citation:
Olivier Gossner, P. H., & Neyman, A. . (2003). Online Matching Pennies. Discussion Papers. presented at the 5. Retrieved from /files/dp316.pdf
Abstract:
We study a repeated game in which one player, the prophet, acquires more information than another player, the follower, about the play that is going to be played. We characterize the optimal amount of information that can be transmitted online by the prophet to the follower, and provide applications to repeated games played by finite automata, and by players with bounded recall.