Related papers: Positive Alexander Duality for Pursuit and Evasion
In this paper an N-pursuer vs. M-evader team conflict is studied. The differential game of border defense is addressed and we focus on the game of degree in the region of the state space where the pursuers are able to win. This work extends…
We show a general method of compiling any $k$-prover non-local game into a single-prover interactive game maintaining the same (quantum) completeness and (classical) soundness guarantees (up to negligible additive factors in a security…
Recently different evolutionary computation approaches have been developed that generate sets of high quality diverse solutions for a given optimisation problem. Many studies have considered diversity 1) as a mean to explore niches in…
Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible…
We consider a dynamical system given by an area-preserving map on a two-dimensional phase plane and consider a one-dimensional line of initial conditions within this plane. We record the number of iterates it takes a trajectory to escape…
We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…
Suppose that in a given planar circular region, there are some smart mobile evaders and we would like to find them using sweeping agents. We assume that each agent has a line sensor of length 2r. We propose procedures for designing…
An alternating graph is a directed graph whose vertex set is partitioned into two classes, existential and universal. This forms the basic arena for a plethora of infinite duration two-player games where Player~$\square$ and~$\ocircle$…
Two-player pursuit-evasion differential game and time optimal zero control problem in $\ell^2$ are considered. Optimal control for the corresponding zero control problem is found. A strategy for the pursuer that guarantees the solution for…
We give a rigorous mathematical proof for the validity of the toric sheaf cohomology algorithm conjectured in the recent paper by R. Blumenhagen, B. Jurke, T. Rahn, and H. Roschy (arXiv:1003.5217). We actually prove not only the original…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
The value of cooperation in pursuit-evasion games is investigated. The considered setting is that of three pursuers chasing one evader in a planar environment. The optimal evader trajectory for a well-known decentralized pursuer strategy is…
We investigate hide-and-seek games on complex networks using a random walk framework. Specifically, we investigate the efficiency of various degree-biased random walk search strategies to locate items that are randomly hidden on a subset of…
This paper explores a multi-agent containment problem, where a fast evader, modeled having constant speed and using constant heading, attempts to escape a circular containment region that is orbited by a slower pursuer with a nonzero…
In this paper we analyze a variant of the pursuit-evasion game on a graph $G$ where the intruder occupies a vertex, is allowed to move to adjacent vertices or remain in place, and is 'invisible' to the searcher, meaning that the searcher…
We study a pursuit-evasion differential game with finite number of pursuers and one evader in Hilbert space with geometric constraints on the control functions of players. We solve the game by presenting explicit strategies for pursuers…
The ability to generate artificial human movement patterns while meeting location and time constraints is an important problem in the security community, particularly as it enables the study of the analog problem of detecting such patterns…
We consider a pursuit-evasion scenario involving a group of pursuers and a single evader in a two-dimensional unbounded environment. The pursuers aim to capture the evader in finite time while ensuring the evader remains enclosed within the…
We introduce a notion of Homological Projective Duality for smooth algebraic varieties in dual projective spaces, a homological extension of the classical projective duality. If algebraic varieties $X$ and $Y$ in dual projective spaces are…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…