We introduce a new model of computation: the online LOCAL model (OLOCAL). In this model, the adversary reveals the nodes of the input graph one by one, in the same way as in classical online algorithms, but for each new node the algorithm can also inspect its radius-$T$ neighborhood before choosing the output; instead of looking ahead in time, we have the power of looking around in space. It is natural to compare OLOCAL with the LOCAL model of distributed computing, in which all nodes make decisions simultaneously in parallel based on their radius-$T$ neighborhoods.

中文翻译：

---

具有环视功能的在线算法

我们引入了一种新的计算模型：在线 LOCAL 模型 (OLOCAL)。在这个模型中，对手一个一个地揭示输入图的节点，与经典在线算法中的方式相同，但对于每个新节点，算法还可以在选择输出之前检查其半径-$T$邻域；我们可以在空间中环顾四周，而不是在时间上向前看。将 OLOCAL 与分布式计算的 LOCAL 模型进行比较是很自然的，其中所有节点基于它们的半径-$T$ 邻域同时并行地做出决策。