A Linearly Relaxed Approximate Linear Program for Markov Decision Processes

DOI10.1109/TAC.2017.2743163zbMath1390.90562arXiv1704.02544OpenAlexW2605818517MaRDI QIDQ4567182

Chandrashekar Lakshminarayanan, Csaba Szepesvári, Shalabh Bhatnagar

Publication date: 27 June 2018

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

Full work available at URL: https://arxiv.org/abs/1704.02544

Mathematics Subject Classification ID

Linear programming (90C05) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ Modelling and solving resource allocation problems via a dynamic programming approach

This page was built for publication: A Linearly Relaxed Approximate Linear Program for Markov Decision Processes