In online scenarios requests arrive over time, and each request must be serviced in an
irrevocable manner before the next request arrives. Online algorithms with advice is an area …

Exploring unknown environments is a fundamental task in many domains, eg, robot
navigation, network security, and internet search. We initiate the study of a learning …

Online algorithms with advice is an area of research where one attempts to measure how
much knowledge of the future is necessary to achieve a given competitive ratio. The lower …

We introduce the study of search problems, in a setting in which the searcher has some
information, or hint concerning the hiding target. In particular, we focus on one of the …

We consider the problem of graph searching with prediction recently introduced by Banerjee
et al.(2023). In this problem, an agent starting at some vertex r has to traverse a (potentially …

Algorithms with advice have received ample attention in the distributed and online settings,
and they have recently proven useful also in dynamic settings. In this work we study local …

We consider the fundamental task of graph exploration. An n-node graph has unlabeled
nodes, and all ports at any node of degree d are arbitrarily numbered 0,…, d− 1. A mobile …

A mobile agent navigating along edges of a simple connected unweighted graph, either
finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes …

We study search games between a mobile Searcher and an immobile Hider in which the
Searcher aims to minimize some payoff, which is either the time to find the Hider (the search …

We study the problem of exploring all nodes of an unknown directed graph. A searcher has
to construct a tour that visits all nodes, but only has information about the parts of the graph it …