Related papers: Minimizing the time to a decision
We provide, in a general setting, explicit solutions for optimal stopping problems that involve a diffusion process and its running maximum. Besides, a new feature includes absorbing boundaries that vary with the value of the running…
Motivated by a novel method for granular segregation, we analyze the one dimensional drift-diffusion between two absorbing boundaries. The time evolution of the probability distribution and the rate of absorption are given by explicit…
We have random number of independent diffusion processes with absorption on boundaries in some region at initial time $t=0$. The initial numbers and positions of processes in region is defined by Poisson random measure. It is required to…
This paper is devoted to the study of the following problem. We have set of diffusion processes with absorption on boundaries in some region at initial time $t=0$. It is required to estimate of number of the unabsorbed processes for the…
We study a majority based preference diffusion model in which the members of a social network update their preferences based on those of their connections. Consider an undirected graph where each node has a strict linear order over a set of…
We consider processes that coincide with a given diffusion process except on the boundaries of a finite collection of domains. The behavior on each of the boundaries is asymmetric: the process is much more likely to enter the interior of…
We determine how long a diffusing particle spends in a given spatial range before it dies at an absorbing boundary. In one dimension, for a particle that starts at $x_0$ and is absorbed at $x=0$, the average residence time in the range…
An agent acquires information dynamically until her belief about a binary state reaches an upper or lower threshold. She can choose any signal process subject to a constraint on the rate of entropy reduction. Strategies are ordered by "time…
We consider a processor sharing queue where the number of jobs served at any time is limited to $K$, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this…
In this paper we consider diffusions on the half line (0, $\infty$) such that the expectation of the arrival time at the origin is uniformly bounded in the initial point. This implies that there is a well defined diffusion process starting…
We model the joint distribution of choice probabilities and decision times in binary choice tasks as the solution to a problem of optimal sequential sampling, where the agent is uncertain of the utility of each action and pays a constant…
We propose a model for diffusion of two opposite opinions. Here, the decision to be taken by each individual is a random variable which depends on the tendency of the population, as well on its own trend characteristic. The influence of the…
We study a model of a population making a binary decision based on information spreading within the population, which is fully connected or covering a square grid. We assume that a fraction of the population wants to make the choice of the…
Diffusion models have become the go-to method for many generative tasks, particularly for image-to-image generation tasks such as super-resolution and inpainting. Current diffusion-based methods do not provide statistical guarantees…
We consider a decision maker who must choose an action in order to maximize a reward function that depends also on an unknown parameter {\Theta}. The decision maker can delay taking the action in order to experiment and gather additional…
The drawdown process of an one-dimensional regular diffusion process $X$ is given by $X$ reflected at its running maximum. The drawup process is given by $X$ reflected at its running minimum. We calculate the probability that a drawdown…
We study a model of consensus decision making, in which a finite group of Bayesian agents has to choose between one of two courses of action. Each member of the group has a private and independent signal at his or her disposal, giving some…
We derive expressions for the first three moments of the decision time (DT) distribution produced via first threshold crossings by sample paths of a drift-diffusion equation. The "pure" and "extended" diffusion processes are widely used to…
Motivated in part by a problem in simulated tempering (a form of Markov chain Monte Carlo) we seek to minimise, in a suitable sense, the time it takes a (regular) diffusion with instantaneous reflection at 0 and 1 to travel from the origin…
To study the effect of boundaries on diffusion of new products, we introduce two novel analytic tools: The indifference principle, which enables us to explicitly compute the aggregate diffusion on various networks, and the dominance…