A Generalized Fundamental Matrix for Computing Fundamental Quantities of Markov Systems

preprint2016arXivOpen access

Abstract

As is well known, the fundamental matrix (I−P+eπ)−1(I - P + e π)^{-1} plays an important role in the performance analysis of Markov systems, where PP is the transition probability matrix, ee is the column vector of ones, and ππ is the row vector of the steady state distribution. It is used to compute the performance potential (relative value function) of Markov decision processes under the average criterion, such as g=(I−P+eπ)−1fg=(I - P + e π)^{-1} f where gg is the column vector of performance potentials and ff is the column vector of reward functions. However, we need to pre-compute ππ before we can compute (I−P+eπ)−1(I - P + e π)^{-1}. In this paper, we derive a generalization version of the fundamental matrix as (I−P+er)−1(I - P + e r)^{-1}, where rr can be any given row vector satisfying re≠0r e \neq 0. With this generalized fundamental matrix, we can compute g=(I−P+er)−1fg=(I - P + e r)^{-1} f. The steady state distribution is computed as π=r(I−P+er)−1π= r(I - P + e r)^{-1}. The Q-factors at every state-action pair can also be computed in a similar way. These formulas may give some insights on further understanding how to efficiently compute or estimate the values of gg, ππ, and Q-factors in Markov systems, which are fundamental quantities for the performance optimization of Markov systems.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.