110 citations · 483 across the 37 of their papers we have counts for
25 papers · 1 filter
Fast and Robust Information Spreading in the Noisy PULL Model
Niccolò D'Archivio, Amos Korman, Emanuele Natale +1
Efficient information spreading in stochastic multi agent systems is a core challenge when communication is noisy, bandwidth limited, and agents lack global coordination. Yet biolo…
On the Role of Memory in Robust Opinion Dynamics
Luca Becchetti, Andrea Clementi, Amos Korman +3
We investigate opinion dynamics in a fully-connected system, consisting of identical and anonymous agents, where one of the opinions (which is called correct) represents a piec…
Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication
Amos Korman, Robin Vacus
How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several…
Public Communication can Facilitate Low-Risk Coordination under Surveillance
Amos Korman, Pierluigi Crescenzi
Consider a sub-population of rebels that wish to initiate a revolution. In order to avoid initializing a failed revolution, rebels would first strive to estimate their relative "po…
Parallel Search with no Coordination
Amos Korman, Yoav Rodeh
We consider a parallel version of a classical Bayesian search problem. agents are looking for a treasure that is placed in one of the boxes indexed by according…
The ANTS problem
Ofer Feinerman, Amos Korman
We introduce the Ants Nearby Treasure Search (ANTS) problem, which models natural cooperative foraging behavior such as that performed by ants around their nest. In this problem, k…