Discrete versions of an algorithm due to Varaiya

DOI10.1109/TAC.1979.1102063MaRDI QIDQ4191942zbMATH OpenFDO

Authors J. L. Popyack, Leonard R. Brown, Chelsea C. White

Publication date 1979

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1979.1102063

zbMATH Keywords

AlgorithmAverage CostMarkov Decision Problem

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55)

Cited in

(7)

• Optimal and near-optimal incentive strategies in the hierarchical control of Markov chains
• An iterative aggregation-disaggregation algorithm for solving linear equations
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes
• A K-step look-ahead analysis of value iteration algorithms for Markov decision processes
• Replacement process decomposition for discounted Markov renewal programming
• Optimal control of discrete time population processes

This page was built for publication: Discrete versions of an algorithm due to Varaiya

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4191942)