Dynamic allocation problems in continuous time
From MaRDI portal
Publication:1333376
DOI10.1214/aoap/1177005062zbMath0831.93069OpenAlexW1995442741MaRDI QIDQ1333376
Nicole El Karoui, Ioannis Karatzas
Publication date: 13 February 1996
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177005062
Optimal stochastic control (93E20) Stopping times; optimal stopping problems; gambling theory (60G40) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items
Optimal stopping problems with restricted stopping times ⋮ A stochastic representation theorem with applications to optimization and obstacle problems. ⋮ Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns ⋮ Bandit and covariate processes, with finite or non-denumerable set of arms ⋮ On Gittins' index theorem in continuous time ⋮ The multi-armed bandit, with constraints ⋮ Optimal activation of halting multi‐armed bandit models ⋮ Index policy for multiarmed bandit problem with dynamic risk measures ⋮ Expected Supremum Representation of the Value of a Singular Stochastic Control Problem ⋮ Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems ⋮ Minimizing the time to a decision ⋮ Optimal learning with non-Gaussian rewards ⋮ A class of solvable singular stochastic control problems ⋮ Two-Armed Restless Bandits with Imperfect Information: Stochastic Control and Indexability ⋮ Gittins' theorem under uncertainty ⋮ On a stochastic representation theorem for Meyer-measurable processes ⋮ On variant reflected backward SDEs, with applications ⋮ Stochastic representation under \(g\)-expectation and applications: the discrete time case ⋮ Multi-armed bandits in discrete and continuous time ⋮ A General Theory of MultiArmed Bandit Processes with Constrained Arm Switches
This page was built for publication: Dynamic allocation problems in continuous time
