|Title:||Semi-markov Decision Processes with Polynomial Reward
|Abstract:||A semi-Markov decision process with a denumerable multidimensional state space is considered. At any given state only a finite number of actions can be taken to control the process. The immediate reward earned in one transition period is merely assumed to be bounded by a polynomial and a bound is imposed on a weighted, moment of the next state reached in one tranaition. It is shown that under an erogicity assumption there is a stationary optimal policy for the long-run average reward criterion. A queueing network scheduling problem is given as an application.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1980/CS/CS0187), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1980
To the main CS technical reports page
Computer science department, Technion