A divide-and-conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To compute a discrete problem with n states and n choices, the algorithm requires at most 5n + log2(n)n function evaluations and so is O(n log2 n). In contrast, existing methods for non-concave...