How to Schedule Measurements of a Noisy Markov Chain in Decision Making?

DOI10.1109/TIT.2013.2253352zbMath1364.90348OpenAlexW1972397806MaRDI QIDQ5346466

Vikram Krishnamurthy

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2013.2253352

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Markov and semi-Markov decision processes (90C40) Measures of information, entropy (94A17)

Related Items (2)

Multiple stopping time POMDPs: structural results \& application in interactive advertising on social media ⋮ Myopic Bounds for Optimal Policy of POMDPs: An Extension of Lovejoy’s Structural Results

This page was built for publication: How to Schedule Measurements of a Noisy Markov Chain in Decision Making?