We consider a model for interacting objects, where the evolution of each object is given by a
finite state Markov chain, whose transition matrix depends on the present and the past of the …

The application of decentralized reputation systems is a promising approach to ensure
cooperation and fairness, as well as to address random failures and malicious attacks in …

We extend the results of Vvedenskaya, Dobrushin and Karpelevich to Jackson networks.
Each node $ j, 1\leq j\leq J $ of the network consists of N identical channels, each with an …

Gossip protocols are designed to operate in very large, decentralised networks. A node in
such a network bases its decision to interact (gossip) with another node on its partial view of …

A queueing system is considered, with a large number $ N $ of identical infinite-buffer FCFS
single-servers. The system is fed by a Poisson flow of rate $\l N $, with iid service times …

The mean-field limit of a Markovian model describing the interaction of several classes of
permanent connections in a network is analyzed. Each of the connections has a self …

This paper analyzes stochastic networks consisting of a set of finite capacity sites where
different classes of individuals move according to some routing policy. The associated …

Gossip protocols are designed to operate in very large, decentralised networks. A node in
such a network bases its decision to interact (gossip) with another node on its partial view of …

A new class of models of queueing networks with load-balanced dynamic routing is
considered. We propose a sufficient condition for positive recurrence of the arising Markov …

A Markovian mean-field multi-class model for the interaction of several classes of permanent
connections in a network is analyzed. Connections create congestion at the nodes they …