Paper Info
Title
Open multi-agent systems: Gossiping with deterministic arrivals and departures.
Abstract
This work is a first step towards the study of open multi-agent systems: systems that agents can join and leave, and where arrivals and departures happen on a time-scale comparable to that of the process running on the system. We study the behavior of the average pairwise gossip algorithm on such open systems, and provide an exact characterization of its evolution in terms of three scale-independent quantities that are shown to be solutions of a 3-dimensional linear dynamical system. We then focus on two particular cases: one where each departure is immediately followed by an arrival, and one where agents keep arriving without ever leaving the system, so that the number of agents grows unbounded.
Year
Venue
Field
2016
2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)
Linear dynamical system,Pairwise comparison,Gossip algorithms,Computer science,Gossip,Multi-agent system,Open system (systems theory),Distributed computing
DocType
ISSN
Citations 
Conference
2474-0195
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Julien M. Hendrickx177277.11
Samuel Martin2717.31