Stochastic approximations for finite-state Markov chains
- 30 June 1990
- journal article
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 35 (1) , 27-45
- https://doi.org/10.1016/0304-4149(90)90120-h
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Optimal priority assignment: a time sharing approachIEEE Transactions on Automatic Control, 1989
- Constrained admission control to a queueing systemAdvances in Applied Probability, 1989
- Optimal priority assignment with hard constraintIEEE Transactions on Automatic Control, 1986
- Optimal policies for controlled Markov chains with a constraintJournal of Mathematical Analysis and Applications, 1985
- K competing queues with geometric service requirements and linear costs: The μc-rule is always optimalSystems & Control Letters, 1985
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimalAdvances in Applied Probability, 1985
- Applications of a Kushner and Clark lemma to general classes of stochastic algorithmsIEEE Transactions on Information Theory, 1984
- Estimation and control in Markov chainsAdvances in Applied Probability, 1974
- On Stochastic ApproximationTheory of Probability and Its Applications, 1965
- A Stochastic Approximation MethodThe Annals of Mathematical Statistics, 1951