Hiding the source of a rumor

Abstract: Consider the following two-player game played on an infinite tree $G$: player one chooses a secret source node, and tries to spread a rumor as quickly as possible from there. Player two sees which nodes know the rumor, and tries to guess where the source was. We will analyze optimal strategies for both players, and examine how robust these strategies are under variants of the game, such as allowing multiple independent observations and requiring local spreading. This is joint work with Miki Racz.