2014/07/27 by Joseph Y. Halpern, Halpern, Joseph Y., Nan Rong +3
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #cs.AI
paper · pdf · doi:10.48550/arxiv.1407.7191
Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)
arxiv created 2014/07/27 · arxiv updated 2014/07/29
Markov decision processes (MDPs) are widely used for modeling decision-making problems in robotics, automated control, and economics. Traditional MDPs assume that the decision maker (DM) knows all states and actions. However, this may not be true in many situations of interest. We define a new framework, MDPs with unawareness (MDPUs) to deal with the possibilities that a DM may not be aware of all possible actions. We provide a complete characterization of when a DM can learn to play near-optimally in an MDPU, and give an algorithm that learns to play near-optimally when it is possible to do so, as efficiently as possible. In particular, we characterize when a near-optimal solution can be found in polynomial time.