Related papers: Optimal Strategies to Catch Randomly Walking Cat
We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same…
Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the same maximum speed as the evader, are necessary and…
Search patterns of randomly oriented steps of different lengths have been observed on all scales of the biological world, ranging from the microscopic to the ecological, including in protein motors, bacteria, T-cells, honeybees, marine…
This paper studies a class of approach-evasion differential games, in which one player aims to steer the state of a dynamic system to the given target set in minimum time, while avoiding some set of disallowed states, and the other player…
In this paper we present an optimal control approach modeling fast exit scenarios in pedestrian crowds. In particular we consider the case of a large human crowd trying to exit a room as fast as possible. The motion of every pedestrian is…
How to best exploit patchy resources? This long-standing question belongs to the extensively studied class of explore/exploit problems that arise in a wide range of situations, from animal foraging, to robotic exploration, and to human…
We give very simple algorithms for best play in the simplest kind of Dots & Boxes endgames: those that consist entirely of loops and long chains. In every such endgame we compute the margin of victory, assuming both players maximize the…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…
A lattice walk model is said to be reluctant if the defining step set has a strong drift towards the boundaries. We describe efficient random generation strategies for these walks.
Given a two-dimensional polygonal space, the multi-robot visibility-based pursuit-evasion problem tasks several pursuer robots with the goal of establishing visibility with an arbitrarily fast evader. The best known complete algorithm for…
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…
In the game "Super Six", after successfully getting rid of a stick by rolling with the die a number that is not occupied, the player has the choice to continue to roll the die or to stop and to hand over the die to their opponent. The…
We investigate the first passage time beyond a barrier located at $b\geq0$ of a random walk with independent and identically distributed jumps, starting from $x_0=0$. The walk is subject to stochastic resetting, meaning that after each step…
The pivot algorithm -- we also call it the pivot chain -- is an algorithm for approximately uniform sampling from $\Omega _{N},$ the set of $N$-step self-avoiding walks on $\mathbb{Z}^{d}$ ($N,$ $d\geq 1$). Based on this algorithm and the…
We consider random walks on a tree $G=(V,E)$ with stationary distribution $\pi_v = \mathrm{deg}(v)/2|E|$ for $v \in V$. Let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at vertex $v$ to…
Bird migration is an adaptive behavior ultimately aiming at optimizing survival and reproductive success. We propose an optimal switching model to study bird migration, where birds' migration behaviors can be efficiently modeled as…
This paper obtains the maximum principle for both stochastic (global) open-loop and stochastic (global) closed-loop Stackelberg differential games. For the closed-loop case, we use the theory of controlled forward-backward stochastic…
We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest…
Motivated by novel results in the theory of complex adaptive systems, we analyze the dynamics of random walks in which the jumping probabilities are {\it time-dependent}. We determine the survival probability in the presence of an absorbing…