Related papers: Approximate Capture in Gromov-Hausdorff Closed Spa…

Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any…

We consider the game of Cops and Robber played on the Cartesian product of two trees. Assuming the players play perfectly, it is shown that if there are two cops in the game, then the length of the game (known as the 2-capture time of the…

This paper studies $l^p$-products of metric spaces and provides estimates for the Gromov-Hausdorff distances between them. The case of linear products is considered separately, and sufficient conditions for attainability of the estimates…

We consider Schmidt's game on the space of compact subsets of a given metric space equipped with the Hausdorff metric, and the space of continuous functions equipped with the supremum norm. We are interested in determining the generic…

We prove that all the compact metric spaces are in the closure of the class of full matrix algebras for the quantum Gromov-Hausdorff propinquity. We also show that given an action of a compact metrizable group G on a quasi-Leibniz compact…

We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds…

In this work, a metric is presented on the set of boundedly-compact pointed metric spaces that generates the Gromov-Hausdorff topology. A similar metric is defined for measured metric spaces that generates the Gromov-Hausdorff-Prokhorov…

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these…

We provide a simple $C^{1,1}$ approximation of the squared Wasserstein distance on R^d when one of the two measures is fixed. This approximation converges locally uniformly. More importantly, at points where the differential of the squared…

We study a variant of the classical Cops and Robbers game with one cop and one robber, in which the cop follows a fixed walk on the graph, a patrol, that is chosen before the game begins, while the robber is omniscient, he knows the entire…

We combine the pointed Gromov-Hausdorff metric [Ron10] with the locally $C^0$ distance to obtain the pointed $C^0$-Gromov-Hausdorff distance between maps of possibly different non-compact pointed metric spaces. The latter is then combined…

We develop persistent homology in the setting of filtrations of (Cech) closure spaces. Examples of filtrations of closure spaces include metric spaces, weighted graphs, weighted directed graphs, and filtrations of topological spaces. We use…

We study a pursuit-evasion game between a double integrator-driven pursuer with bounded velocity and bounded acceleration and a single integrator-driven evader with bounded velocity in a two-dimensional plane. The pursuer's goal is to…

We study a pursuit-evasion problem which can be viewed as an extension of the keep-away game. In the game, pursuer(s) will attempt to intersect or catch the evader, while the evader can visit a fixed set of locations, which we denote as the…

The Gromov-Hausdorff distance between two metric spaces measures how far the spaces are from being isometric. It has played an important and longstanding role in geometry and shape comparison. More recently, it has been discovered that the…

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

We study the following question dating back to J.E. Littlewood (1885-1977): Can two lions catch a man in a bounded area with rectifiable lakes? The lions and the man are all assumed to be points moving with at most unit speed. That the…

The greedy and nearest-neighbor TSP heuristics can both have $\log n$ approximation factors from optimal in worst case, even just for $n$ points in Euclidean space. In this note, we show that this approximation factor is only realized when…

We develop various Ehrenfeucht-Fra\"{\i}ss\'{e} games for distances between metric structures. We study two forms of distances: pseudometrics stemming from mapping spaces onto each other with some form of approximate isomorphism, and…

What is the analogous notion of Gromov-Hausdorff convergence for sequences of spacetimes? Since a Lorentzian manifold is not inherently a metric space, one cannot simply use the traditional definition. One approach offered by Sormani and…