Strategic Information Transmission over Gossip Networks
We consider a fully connected gossip network of $n$ nodes that track a binary continuous-time Markov source through a strategic sender transmitting updates under a communication budget at a rate that depends on the source state. The receivers exchange packets through gossip and decide whether to follow the sender. We m...