<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Searching in Euclidean spaces with predictions</dc:title><dc:creator>Cabello,	Sergio	(Avtor)
	</dc:creator><dc:creator>Giannopoulos,	Panos	(Avtor)
	</dc:creator><dc:subject>search games</dc:subject><dc:subject>predictions</dc:subject><dc:subject>distance</dc:subject><dc:subject>computational geometry</dc:subject><dc:description>We study the problem of searching for a target at some unknown location in ${\mathbb R}^d$ when additional information regarding the position of the target is available in the form of predictions. In our setting, predictions come as approximate distances to the target: for each point $p \in {\mathbb R}^d$ that the searcher visits, we obtain a value $\lambda (p)$ such that $|pt|\le \lambda (p) \le c\cdot |pt|$, where $c \ge 1$ is a fixed constant, $t$ is the position of the target, and $|pt|$ is the Euclidean distance of $p$ to $t$. The cost of the search is the length of the path followed by the searcher. Our main positive result is a strategy that achieves $O(c^d)$-competitive ratio, even when the constant c is unknown. We also give a lower bound of roughly $(c/4)^{d-1}$ on the competitive ratio of any search strategy in ${\mathbb R}^d$, assuming that $c\ge 4$.</dc:description><dc:date>2026</dc:date><dc:date>2026-09-28 14:47:58</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>188803</dc:identifier><dc:identifier>UDK: 004.9</dc:identifier><dc:identifier>ISSN pri članku: 1432-4350</dc:identifier><dc:identifier>DOI: 10.1007/s00224-026-10291-w</dc:identifier><dc:identifier>COBISS_ID: 292763139</dc:identifier><dc:language>sl</dc:language></metadata>
