Online Matching Pennies
- Published in 2003
- Added on
In the collections
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.
Links
- https://ratio.huji.ac.il/publications/online-matching-pennies
- https://ratio.huji.ac.il/files/dp316.pdf
Other information
- key
- OnlineMatchingPennies
- type
- article
- date_added
- 2024-05-20
- date_published
- 2003-10-09
BibTeX entry
@article{OnlineMatchingPennies, key = {OnlineMatchingPennies}, type = {article}, title = {Online Matching Pennies}, author = {Olivier Gossner, Penelope Hernandez, Abraham Neyman}, 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.}, comment = {}, date_added = {2024-05-20}, date_published = {2003-10-09}, urls = {https://ratio.huji.ac.il/publications/online-matching-pennies,https://ratio.huji.ac.il/files/dp316.pdf}, collections = {games-to-play-with-friends,protocols-and-strategies}, url = {https://ratio.huji.ac.il/publications/online-matching-pennies https://ratio.huji.ac.il/files/dp316.pdf}, year = 2003, urldate = {2024-05-20} }