Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Lidbetter, Thomas"'
We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, i.e., a prediction on the Hider's position. The objective is to establish tight
Externí odkaz:
http://arxiv.org/abs/2401.01149
Consider a two-person zero-sum search game between a Hider and a Searcher. The Hider chooses to hide in one of $n$ discrete locations (or "boxes") and the Searcher chooses a search sequence specifying which order to look in these boxes until finding
Externí odkaz:
http://arxiv.org/abs/2306.10908
Autor:
Lidbetter, Thomas F.
Let $S$ be a finite subset of $\mathbb{Z}^n$. A vector sequence $(\mathbf{z}_i)$ is an $S$-walk if and only if $\mathbf{z}_{i+1} - \mathbf{z}_i$ is an element of $S$ for all $i$. Gerver and Ramsey showed in 1979 that for $S\subset \mathbb{Z}^3$ there
Externí odkaz:
http://arxiv.org/abs/2303.14579
Autor:
Alpern, Steve, Lidbetter, Thomas
Adversarial search of a network for an immobile Hider (or target) was introduced and solved for rooted trees by Gal (1979). In this zero-sum game, a Hider picks a point to hide on the tree and a Searcher picks a unit speed trajectory starting at the
Externí odkaz:
http://arxiv.org/abs/2303.13378
Autor:
Bui, Thuy, Lidbetter, Thomas
We present solutions to a continuous patrolling game played on network. In this zero-sum game, an Attacker chooses a time and place to attack a network for a fixed amount of time. A Patroller patrols the network with the aim of intercepting the attac
Externí odkaz:
http://arxiv.org/abs/2210.15045
We consider the problem of solving the Min-Sum Submodular Cover problem using local search. The Min-Sum Submodular Cover problem generalizes the NP-complete Min-Sum Set Cover problem, replacing the input set cover instance with a monotone submodular
Externí odkaz:
http://arxiv.org/abs/2209.03054
Autor:
Lidbetter, Thomas, Xie, Yifan
We consider a search and rescue game introduced recently by the first author. An immobile target or targets (for example, injured hikers) are hidden on a graph. The terrain is assumed to dangerous, so that when any given vertex of the graph is search
Externí odkaz:
http://arxiv.org/abs/2208.00482
Publikováno v:
In European Journal of Operational Research 1 March 2024 313(2):767-775
Autor:
Hellerstein, Lisa, Lidbetter, Thomas
We consider the problem of maximizing the minimum (weighted) value of all components of a vector over a polymatroid. This is a special case of the lexicographically optimal base problem introduced and solved by Fujishige. We give an alternative formu
Externí odkaz:
http://arxiv.org/abs/2104.10236
Autor:
Lidbetter, Thomas F.
Publikováno v:
In Discrete Mathematics January 2024 347(1)