Related papers: Target competition for resources under diffusive s…
We develop a game-theoretic framework for the study of competition between firms who have budgets to "seed" the initial adoption of their products by consumers located in a social network. The payoffs to the firms are the eventual number of…
We study a general model on reusable resource allocation under model uncertainty. A heterogeneous population of customers arrive at the decision maker's (DM's) platform sequentially. Upon observing a customer's type, the DM selects an…
In this work we consider the problem of searches that utilises past information gathered during searching, to evaluate the probability distribution of finding the source at each step. We start with a sample strategy where the movement at…
In this paper, we analyze the mean first passage time (MFPT) for a single Brownian particle to find a stochastically-gated target under the additional condition that the position of the particle is reset to a fixed position $\x_r$ at a rate…
What happens when a continuously evolving stochastic process is interrupted with large changes at random intervals $\tau$ distributed as a power-law $\sim \tau^{-(1+\alpha)};\alpha>0$? Modeling the stochastic process by diffusion and the…
It is well known that a sparsely coded network in which the activity level is extremely low has intriguing equilibrium properties. In the present work, we study the dynamical properties of a neural network designed to store sparsely coded…
The problem of the time required for a diffusing molecule, within a large bounded domain, to first locate a small target is prevalent in biological modeling. Here we study this problem for a small spherical target. We develop uniform in…
We study the problem of a target search by a Brownian particle subject to stochastic resetting to a pair of sites. The mean search time is minimized by an optimal resetting rate which does not vary smoothly, in contrast with the well-known…
We study a resource allocation problem with varying requests, and with resources of limited capacity shared by multiple requests. It is modeled as a set of heterogeneous Restless Multi-Armed Bandit Problems (RMABPs) connected by constraints…
In this paper, we investigate the problem of joint searching and tracking of multiple mobile targets by a group of mobile agents. The targets appear and disappear at random times inside a surveillance region and their positions are random…
The stochastic motion in a nonhomogeneous medium with traps is studied and diffusion properties of that system are discussed. The particle is subjected to a stochastic stimulation obeying a general L\'evy stable statistics and experiences…
We consider global optimization problems, where the feasible region $\X$ is a compact subset of $\mathbb{R}^d$ with $d \geq 10$. For these problems, we demonstrate the following. First: the actual convergence of global random search…
The problem of natural selection in dispersal-structured populations consisting of individuals characterized by different diffusion coefficients is studied. The competition between the organisms is taken into account through the assumption…
Will the strategy of resetting} help a stochastic process to reach its target efficiently, with its environment continually toggling between a strongly favourable and an unfavourable (or weakly favourable) state? A diffusive run-and-tumble…
The effect of partial absorption on a diffusive particle which stochastically resets its position with a finite rate $r$ is considered. The particle is absorbed by a target at the origin with absorption `velocity' $a$; as the velocity $a$…
Given an endogenous timescale set by invasion in a constant environment, we introduced periodic temporal variation in competitive superiority by alternating the species' propagation rates. By manipulating habitat size and introduction rate,…
We study an individual-based model in which two spatially-distributed species, characterized by different diffusivities, compete for resources. We consider three different ecological settings. In the first, diffusing faster has a cost in…
We construct a diffusion approximation of a repeated game in which agents make bets on outcomes of i.i.d. random vectors and their strategies are close to an asymptotically optimal strategy. This model can be interpreted as trading in an…
We propose a method for analyzing the distributed random coordinate descent algorithm for solving separable resource allocation problems in the context of an open multiagent system, where agents can be replaced during the process. In…
We consider qualitative strategy synthesis for the formalism called consumption Markov decision processes. This formalism can model dynamics of an agents that operates under resource constraints in a stochastic environment. The presented…