Pages that link to "Item:Q2717785"

The following pages link to Nonapproximability results for partially observable Markov decision processes (Q2717785):

Displaying 11 items.

• Optimal cost almost-sure reachability in POMDPs (Q253969) (← links)
• On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
• Compactness of the space of non-randomized policies in countable-state sequential decision processes (Q966432) (← links)
• Partially observable Markov decision processes with imprecise parameters (Q1028935) (← links)
• On the complexity of partially observed Markov decision processes (Q1351500) (← links)
• The complexity of optimal small policies (Q2757626) (← links)
• Minimal disclosure in partially observable Markov decision processes (Q2911642) (← links)
• Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes (Q2938106) (← links)
• Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions (Q6080639) (← links)
• Optimality guarantees for particle belief approximation of POMDPs (Q6488812) (← links)
• Regular decision processes (Q6566638) (← links)