Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree
on a message from a designated sender, even if some processes (including the sender) are …

The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a
rumour in a graph G, is defined as follows. Independent exponential clocks of rate 1 are …

In the gossip-based model of communication for disseminating information in a network, in
each time unit, every node u can contact a single random neighbor v but can possibly be …

We consider a population of n agents which communicate with each other in a decentralized
manner, through random pairwise interactions. One or more agents in the population may …

We study the problem of randomized information dissemination in networks. We compare
the now standard push-pull protocol, with agent-based alternatives where information is …

The scalability of concurrent data structures and distributed algorithms strongly depends on
reducing the contention for shared resources and the costs of synchronization and …

Gossip protocols (also called rumor spreading or epidemic protocols) are widely used to
disseminate information in massive peer-to-peer networks. These protocols are often …

We initiate the study of game dynamics in the population protocol model: n agents each
maintain a current local strategy and interact in pairs uniformly at random. Upon each …

We initiate the study of repeated game dynamics in the population model, in which we are
given a population of $ n $ nodes, each with its local strategy, which interact uniformly at …

In the stochastic population protocol model, we are given a connected graph with n nodes,
and in every time step, a scheduler samples an edge of the graph uniformly at random and …