Related papers: God Save the Queen
Two models of a queue are proposed: a human queue and two lines of vehicles before a narrowing. In both models, a queuer tries to evaluate his waiting time, taking into account the delay caused by intruders who jump to the queue front. As…
We show that the expected time for a smart "cop" to catch a drunk "robber" on an $n$-vertex graph is at most $n + {\rm o}(n)$. More precisely, let $G$ be a simple, connected, undirected graph with distinguished points $u$ and $v$ among its…
We study security games in which a defender commits to a mixed strategy for protecting a finite set of targets of different values. An attacker, knowing the defender's strategy, chooses which target to attack and for how long. If the…
Three abilities - the ability to recognize sounds, the ability to visually recognize movement and the ability to keep an upright standing position - can function only with using precise measurements of the short time intervals. Other…
The growing frequency and intensity of wildfires pose serious threats to communities in wildland-urban interface regions. Understanding evacuation behavior is critical for effective emergency planning. This study analyzes evacuation during…
We propose a decentralized solution for a pursuit-evasion game involving a heterogeneous group of rational (selfish) pursuers and a single evader based on the framework of potential games. In the proposed game, the evader aims to delay (or,…
Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among $n$ discrete locations, and the searcher successively visits individual locations until finding the hider. Known to both players, a search at…
Many physical and chemical phenomena are governed by stochastic escape across potential barriers. The escape time depends on the structure of the noise and the shape of the potential barrier. By applying $\alpha$-stable noise from the…
Evacuation of robots from a disk has attained a lot of attention recently. We visit the problem from the perspective of fault-tolerance. We consider two robots trying to evacuate from a disk via a single hidden exit on the perimeter of the…
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits a correct behaviour. Speculation consists in guaranteeing that the system satisfies its requirements for any execution…
Narrow escape and narrow capture problems which describe the average times required to stop the motion of a randomly travelling particle within a domain have applications in various areas of science. While for general domains, it is known…
We study population dynamics under which each revising agent tests each strategy k times, with each trial being against a newly drawn opponent, and chooses the strategy whose mean payoff was highest. When k = 1, defection is globally stable…
State-of-the-art emergency navigation approaches are designed to evacuate civilians during a disaster based on real-time decisions using a pre-defined algorithm and live sensory data. Hence, casualties caused by the poor decisions and…
We study the optimal stopping of an American call option in a random time-horizon under exponential spectrally negative L\'evy models. The random time-horizon is modeled as the so-called Omega default clock in insurance, which is the first…
We consider a perimeter defense problem in a planar conical environment comprising a single turret that has a finite range and non-zero service time. The turret seeks to defend a concentric perimeter against $N\geq 2$ intruders. Upon…
The Pandora's Box problem models the search for the best alternative when evaluation is costly. In the simplest variant, a decision maker is presented with $n$ boxes, each associated with a cost of inspection and a hidden random reward. The…
In this paper, we propose new algorithms for evacuation problems defined on dynamic flow networks. A dynamic flow network is a directed graph in which source nodes are given supplies (i.e., the number of evacuees) and a single sink node is…
We consider the classic cake-cutting problem of producing envy-free allocations, restricted to the case of four agents. The problem asks for a partition of the cake to four agents, so that every agent finds her piece at least as valuable as…
The paper considers a process of escape of classical particle from a one-dimensional potential well by virtue of an external harmonic forcing. We address a particular model of the infinite-range potential well that allows independent…
We study the exit time from a bounded multi-dimensional domain $\Omega$ of the stochastic process $\mathbf{Y}_\varepsilon=\mathbf{Y}_\varepsilon(t,a)$, $t\geqslant 0$, $a\in \mathcal{A}$, governed by the overdamped Langevin dynamics…