On the Optimality of Greedy Meta-Deliberation

We present a unified notation that captures many common models of deliberation for a resourcebounded agent in a time-critical environment. We analyze a greedy time-slicing meta-deliberation procedure within our framework, the same procedure that forms the basis of many diverse metadeliberation algorithms. The procedure is computationally efficient, and our analysis makes explicit the domains over which it is optimal.