Biological ensembles use collective intelligence to tackle challenges together, but
suboptimal coordination can undermine the effectiveness of group cognition. Testing …

We consider the problem of searching for an unknown target vertex $ t $ in a (possibly edge-
weighted) graph. Each\emph {vertex-query} points to a vertex $ v $ and the response either …

We consider a search problem on trees in which the goal is to find an adversarially placed
treasure, while relying on local, partial information. Specifically, each node in the tree holds …

We consider a search problem on trees aiming to find a treasure that an adversary places at
one of the nodes. The algorithm can query nodes and extract directional information from …

Guess Who is a two-player search game in which each player chooses a character from a
deck of 24 cards, and has to infer the other player's character by asking yes-no questions. A …

We consider a search problem on trees in which an agent starts at the root of a tree and
aims to locate an adversarially placed treasure, by moving along the edges, while relying on …

We study the biased random walk where at each step of a random walk a “controller” can,
with a certain small probability, move the walk to an arbitrary neighbour. This model was …

We consider a search problem on trees using unreliable guiding instructions. Specifically,
an agent starts a search at the root of a tree aiming to find a treasure hidden at one of the …

Computing with mobile agents is rapidly becoming a topic of mainstream research in the
theory of distributed computing. The main research questions undertaken in this study …

In this paper, we deal with an error model in distributed networks. For a target t, every node
is assumed to give an advice, ie. to point to a neighbour that take closer to the destination …