

![0_image_0.png](0_image_0.png)

policy obtained by our approach was optimal for this problem. Thus, in this problem, the ability to exploit additive independence allows an efficient **polynomial time solution.**
We have also compared Apricodd to our rule-based approximate linear programming algorithm on the Process-SysAdmin **problem. This problem has significant additive structure in the reward function and factorization in the transition model. Although this type of**
structure is not exploited directly by Apricodd, the ADD approximation steps performed by the algorithm can, in principle, allow Apricodd to find approximate solutions to the problem. We spent a significant amount of time attempting to find the best set of parameters for Apricodd for these problems.4 **We settled on the "sift" method of variable reordering**
and the "round" approximation method with the "size" (maximum ADD size) criteria. To 4. We are very grateful to Jesse Hoey and Robert St-Aubin for their assistance in selecting the parameters.