Minimizing the time to a decision
From MaRDI portal
Abstract: Suppose we have three independent copies of a regular diffusion on with absorbing boundaries. Of these diffusions, either at least two are absorbed at the upper boundary or at least two at the lower boundary. In this way, they determine a majority decision between 0 and 1. We show that the strategy that always runs the diffusion whose value is currently between the other two reveals the majority decision whilst minimizing the total time spent running the processes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3947360 (Why is no real title available?)
- scientific article; zbMATH DE number 3714680 (Why is no real title available?)
- scientific article; zbMATH DE number 3474804 (Why is no real title available?)
- scientific article; zbMATH DE number 1245556 (Why is no real title available?)
- scientific article; zbMATH DE number 707209 (Why is no real title available?)
- scientific article; zbMATH DE number 862533 (Why is no real title available?)
- Continuous multi-armed bandits and multiparameter processes
- Coupling of multidimensional diffusions by reflection
- Doubly perturbed jump-diffusion processes
- Doubly perturbed neutral stochastic functional equations
- Dynamic allocation problems in continuous time
- Lévy bandits: Multi-armed bandits driven by Lévy processes
- Multi-armed bandits in discrete and continuous time
- ON ONE-DIMENSIONAL STOCHASTIC DIFFERENTIAL EQUATIONS INVOLVING THE MAXIMUM PROCESS
- Optimal Switching among Several Brownian Motions
- Optimal switching between a pair of Brownian motions
- Perturbed Brownian motions
- Perturbed Skorohod equations and perturbed reflected diffusion processes
- Random-Turn Hex and Other Selection Games
- Some calculations for doubly perturbed Brownian motion
- Stochastic integrals in the plane
- Synchronization and optimality for multi-armed bandit problems in continuous time
- Upper and lower limits of doubly perturbed Brownian motion
- Variably skewed Brownian motion
This page was built for publication: Minimizing the time to a decision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655582)