Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy

DOI10.1007/BF01432808zbMath0826.90120OpenAlexW2015356680WikidataQ115149440 ScholiaQ115149440MaRDI QIDQ4698113

J. A. Loeve, Arie Hordijk

Publication date: 25 June 1995

Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01432808

zbMATH Keywords

successive approximationpartial state informationMarkov decision chainadmissible policieslocally optimal periodic policyqueueing network with server control

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

On complementary triples of Sturmian bisequences ⋮ A transformation method for stochastic control problems with partial observations ⋮ Analysis of a finite-source customer assignment model with no state information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of solution techniques for the partially observed Markov decision process
• Markov-Entscheidungs-Prozesse mit abhängigen Aktionen für optimale Reparaturmaßnahmen bei unvollständiger Information. (Markov decision processes with dependent actions for optimal repair policies under incomplete information)
• Markov programming with policy constraints
• A survey of algorithmic methods for partially observed Markov decision processes
• State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
• Decentralized control of finite state Markov processes
• Decentralized control in packet switched satellite communication
• The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
• On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
• The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
• Markov Decisions on a Partitioned State Space

This page was built for publication: Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy