Policy Decomposition for Evaluation Performance Improvement of PDP

Algorithm 1

Greedy algorithm of policy decomposition.

Input: Cost, k

Output: k subsets

(1) Cost′ = Heap_Sort(Cost)

(2) for the first k elements do

(3)  distributed respectively to one of k subsets

(4) end for

(5) A min-heap minHeap with the first k elements is built

(6) for the remainder elements of Cost′  do

(7)    distributed successively to one of k elements in minHeap,

   whose sum value is always kept the smallest

(8)    minHeap is adjusted

(9) end for