Mertzios, George B. ;
Nikoletseas, Sotiris E. ;
Raptopoulos, Christoforos L. ;
Spirakis, Paul G.
Stably Computing Order Statistics with Arithmetic Population Protocols
Abstract
In this paper we initiate the study of populations of agents with very limited capabilities that are globally able to compute order statistics of their arithmetic input values via pairwise meetings.
To this extent, we introduce the Arithmetic Population Protocol (APP) model, embarking from the well known Population Protocol (PP) model and inspired by two recent papers in which states are treated as integer numbers. In the APP model, every agent has a state from a set Q of states, as well as a fixed number of registers (independent of the size of the population), each of which can store an element from a totally ordered set S of samples. Whenever two agents interact with each other, they update their states and the values stored in their registers according to a joint transition function. This transition function is also restricted; it only allows (a) comparisons and (b) copy / paste operations for the sample values that are stored in the registers of the two interacting agents.
Agents can only meet in pairs via a fair scheduler and are required to eventually converge to the same output value of the function that the protocol globally and stably computes.
We present two different APPs for stably computing the median of the input values, initially stored on the agents of the population.
Our first APP, in which every agent has 3 registers and no states, stably computes (with probability 1)
the median under any fair scheduler in any strongly connected directed (or connected undirected) interaction graph.
Under the probabilistic scheduler, we show that our protocol stably computes the median in O(n^6) number of interactions in a connected undirected interaction graph of n agents.
Our second APP, in which every agent has 2 registers and O(n^2 log{n}) states, computes to the correct median of the input with high probability in O(n^3 log{n}) interactions, assuming the probabilistic scheduler and the complete interaction graph. Finally we present a third APP which, for any k, stably computes the kth smallest element of the input of the population under any fair scheduler and in any strongly connected directed (or connected undirected) interaction graph. In this APP every agent has 2 registers and n states. Upon convergence every agent has a different state; all these states provide a total ordering of the agents with respect to their input values.
BibTeX  Entry
@InProceedings{mertzios_et_al:LIPIcs:2016:6480,
author = {George B. Mertzios and Sotiris E. Nikoletseas and Christoforos L. Raptopoulos and Paul G. Spirakis},
title = {{Stably Computing Order Statistics with Arithmetic Population Protocols}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {68:168:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770163},
ISSN = {18688969},
year = {2016},
volume = {58},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6480},
URN = {urn:nbn:de:0030drops64805},
doi = {10.4230/LIPIcs.MFCS.2016.68},
annote = {Keywords: arithmetic population protocols, order statistics, median, kminimum element}
}
2016
Keywords: 

arithmetic population protocols, order statistics, median, kminimum element 
Seminar: 

41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)

Issue date: 

2016 
Date of publication: 

2016 