Gossip with transmission constraints

We consider an asynchronous stochastic approximation version of the classical gossip algorithm wherein the inter-processor communication is subject to transmission delays. We highlight some fundamental difficulties associated with it and suggest an alternative scheme based on reinforcement learning.