In C-173,
the notion of pseudo expectation has been proposed
for analyzing relatively simple Markov processes,
which would be often seen as simple execution models of local search algorithms.
In this paper,
we first explain how it is used,
and then investigate
the approximation error bound of pseudo expectations.