Advanced Search

This paper focuses on the constrained optimality of discrete-time Markov decision processes (DTMDPs) with state-dependent discount factors, Borel state and compact Borel action spaces, and possibly unbounded costs. By means of the properties of so-called occupation measures of policies and the technique of transforming the original constrained optimality problem of DTMDPs into a convex program one, we prove the existence of an optimal randomized stationary policies under reasonable conditions.

Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ into $S$ is a finite nondecreasing sequence of positive integers $a_1,a_2,\cdots ,a_r$ in $S$ with repetitions allowed such that ${\sum }_{i=1}^r{a}_i=n$. Here we apply Pólya’s enumeration theorem to find the number $\P (n;S)$ of partitions of $n$ into $S$, and the number $\mathrm{D}P(n;S)$ of distinct partitions of $n$ into $S$. We also present recursive formulas for computing $\P (n;S)$ and $\mathrm{D}P(n;S)$.