Asymptotically efficient strategies for a stochastic scheduling problem with order constraints.
From MaRDI portal
Publication:1848847
DOI10.1214/aos/1015957475zbMath1105.62365OpenAlexW1560163377MaRDI QIDQ1848847
Publication date: 14 November 2002
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1015957475
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Sequential statistical design (62L05) Sequential statistical analysis (62L10)
Related Items (4)
Optimal strategies for a class of sequential control problems with precedence relations ⋮ Estimation in hidden Markov models via efficient importance sampling ⋮ Sequential Generalized Likelihood Ratios and Adaptive Treatment Allocation for Optimal Sequential Selection ⋮ A tutorial on geometric programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov additive processes. I: Eigenvalue properties and limit theorems
- Irreversible adaptive allocation rules
- Markov chains and stochastic stability
- Asymptotically efficient adaptive allocation rules
- Poisson equation, moment inequalities and quick convergence for Markov random walks.
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
- Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
- A dependent data extension of Wald's identity and its application to sequential test performance computation
- Wald's equations, first passage times and moments of ladder variables in Markov random walks
- On the undiscounted tax problem with precedence constraints
- Strategy evaluation for stochastic scheduling problems with order constraints
- A Method for Obtaining and Analyzing Sensitivity Data
- Some aspects of the sequential design of experiments
This page was built for publication: Asymptotically efficient strategies for a stochastic scheduling problem with order constraints.