Robust decomposable Markov decision processes motivated by allocating school budgets
Dimitrov, Nedialko B.
MetadataShow full item record
Motivated by an application to school funding, we introduce the notion of a robust decomposable Markov decision process (MDP). A robust decomposable MDP model applies to situations where several MDPs, with the transition probabilities in each only known through an uncertainty set, are coupled together by joint resource constraints. Robust decomposable MDPs are different than both decomposable MDPs, and robust MDPs and can not be solved by a direct application of the solution methods from either of those areas. In fact, to the best of our knowledge, there is no known method to tractably compute optimal policies in robust, decomposable MDPs. We show how to tractably compute good policies for this model, and apply the derived method to a stylized school funding example.
Showing items related by title, author, creator and subject.
Ulker, Birol (Monterey, Calif. Naval Postgraduate School, 2002-03);A logical function f is AND bi-decomposable if it can be written as f x1, x2)= h1 (x1) h2(x2), where x1 and x2 are disjoint. Such functions are important because they can be efficiently implemented. Also many benchmark ...
Hutchison, William Edwin (University of Maryland, 1967);An approach to a force level problem which incorporates inputs of cost, operational effectiveness and requirements into a decision procedure is suggested. The problem is then defined within the framework of a decomposable ...
Sasao, Tsutomu; Butler, Jon T. (2001);A function f is AND bi-decomposable if it can be written as f (X1;X2) = h1(X1)h2(X2). In this case, a sum-ofproducts expression (SOP) for f is obtained from minimum SOPs (MSOP) for h1 and h2 by applying the law of ...