Skip Navigation

Applied Mathematics Research eXpress (2005) Vol. 2005 : article ID 61, 76 pages, doi:10.1155/AMRX.2005.61
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow How to cite this article
Google Scholar
Right arrow Articles by Zhu, Q.
Right arrow Articles by Guo, X.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2005 Hindawi Publishing Corporation. All rights reserved.

Value iteration for average cost Markov decision processes inBorel spaces

Quanxin Zhu and Xianping Guo

This paper deals with the value iteration algorithm (VIA) for average cost Markov decision processes in Borel state and action spaces. The costs may have neither upper nor lower bounds, instead of the case of nonnegative (or bounded below) costs widely used in the previous literature. We propose aset of conditions which is weaker than those in the previous literature. Under these conditions, we first establish the average cost optimality equation. Then under an additional condition, we show that the VIA yields the optimal (minimum) average cost, anaverage optimal stationary policy, and a solution to the average cost optimality equation. Finally, we use an example to illustrate our conditions.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.