Reversible Markov decision processes and the Gaussian free field
From MaRDI portal
Publication:2107621
Abstract: A Markov decision problem is called reversible if the stationary controlled Markov chain is reversible under every stationary Markovian strategy. A natural application in which such problems arise is in the control of Metropolis-Hastings type dynamics. We characterize all discrete time reversible Markov decision processes with finite state and actions spaces. We show that policy iteration algorithm for finding an optimal policy can be significantly simplified Markov decision problems of this type. We also highlight the relation between the finite time evolution of the accrual of reward and the Gaussian free field associated to the controlled Markov chain.
Recommendations
Cites work
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- Gaussian Hilbert Spaces
- Graph theory
- Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
- Probability on trees and networks
- Reversible Markov Decision Processes with an Average-Reward Criterion
Cited in
(2)
This page was built for publication: Reversible Markov decision processes and the Gaussian free field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107621)