Abstract
Discounted dynamic programming problems whose transition mechanism depends only on the action taken and does not depend on the current state are considered. A value determination operation and method of obtaining optimal policies for the case of finite action space (and arbitrary state space) are presented.The solution of other problems is reduced to this special case by a suitable transformation. Results are illustrated by examples.

This publication has 4 references indexed in Scilit: