Related papers: Target competition for resources under diffusive s…
Stochastic service systems describe situations in which customers compete for service from scarce resources. Think of check-in lines at airports, waiting rooms in hospitals or queues in supermarkets, where the scarce resource is human…
Dynamic resource allocation problems are ubiquitous, arising in inventory management, order fulfillment, online advertising, and other applications. We initially focus on one of the simplest models of online resource allocation: the…
In this paper we consider diffusion in a domain $\Omega$ containing a partially absorbing target $\calM$ with position and occupation time resetting. The occupation time $A_t$ is a Brownian functional that determines the amount of time that…
In this review, we present the encounter-based approach to target search problems, in which the diffusive dynamics is described by the joint probability of the position of the particle and the number of its encounters with a given target…
Following some recent works, we investigate the problem of optimising the total population size for logistic diffusive models with respect to resources distributions. Using the spatially heterogeneous Fisher-KPP equation, we obtain a…
We consider a mutation-selection model of a population structured by the spatial variables and a trait variable which is the diffusion rate. Competition for resource is local in spatial variables, but nonlocal in the trait variable. We…
We study a model of competition among nomadic agents for time-varying and location-specific resources, arising in crowd-sourced transportation services, online communities, and traditional location-based economic activity. This model…
We consider diffusion under stochastic resetting to the origin in one dimension and compute the mean time to find both of two targets placed either side of the origin. A surprising result is that increasing the distance between two targets…
Efficient spatial exploration is a key aspect of search and rescue. In this paper, we present a search algorithm that generates efficient trajectories that optimize the rate at which probability mass is covered by a searcher. This should…
We theoretically address minimal search strategies of active, self-propelled particles towards hidden targets in three-dimensional space. The particles can sense if a target is close, e.g., by detecting signaling molecules released by a…
A fundamental problem in resource theory is to study the manipulation of the resource. Focusing on a general dynamical resource theory of quantum channels, here we consider tasks of one-shot resource distillation and dilution with a single…
Dispersal is an important strategy that allows organisms to locate and exploit favorable habitats. The question arises: given competition in a spatially heterogeneous landscape, what is the optimal rate of dispersal? Continuous population…
A dynamical model for the distribution of resources between competing agents is studied. While global competition leads to the accumulation of all the resources by a single agent, local competition allows for a wider resource distribution.…
We develop an asymptotic analysis of target fluxes in the three-dimensional (3D) narrow capture problem. The latter concerns a diffusive search process in which the targets are much smaller than the size of the search domain. The small…
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. We first show that intermittent…
We address the problem of random search for a target in an environment with space-dependent diffusion coefficient $D(x)$. From a general form of the diffusion differential operator that includes It\^o, Stratonovich, and…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
Consider a species whose population density solves the steady diffusive logistic equation in a heterogeneous environment modeled with the help of a spatially non constant coefficient standing for a resources distribution in a given box. We…
We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. We deduce analytical expressions for the stationary occupation probability and for the mean and global first…
Motivated by programmatic advertising optimization, we consider the task of sequentially allocating budget across a set of resources. At every time step, a feasible allocation is chosen and only a corresponding random return is observed.…