The Complexity of Markov Decision Processes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Partially observable Markov decision processes with imprecise parameters
- On the control of discrete-event dynamical systems
- On players with a bounded number of states
- The complexity of dynamic programming
- A theory of strict P-completeness
- On the complexity of partially observed Markov decision processes
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
- k-Certainty Exploration Method: an action selector to identify the environment in reinforcement learning
- Reachability analysis of quantum Markov decision processes
- On the computability of Solomonoff induction and AIXI
- A novel scheduling index rule proposal for QoE maximization in wireless networks
- Linear programming formulation for non-stationary, finite-horizon Markov decision process models
- Computation of weighted sums of rewards for concurrent MDPs
- A fast approximation method for partially observable Markov decision processes
- Markov decision processes under observability constraints
- On probabilistic timed automata.
- A mean-variance optimization problem for discounted Markov decision processes
- The partially observable Markov decision processes in healthcare: an application to patients with ischemic heart disease (IHD)
- Game theory on attack graph for cyber deception
- Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
- Verifying Pufferfish privacy in hidden Markov models
- Algorithms and conditional lower bounds for planning problems
- Reasoning about uncertain parameters and agent behaviors through encoded experiences and belief planning
- POMDPs under probabilistic semantics
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
- Robotic manipulation of multiple objects as a POMDP
- Partially observable Markov decision model for the treatment of early prostate cancer
- PageRank optimization by edge selection
- Strong planning under partial observability
- NP-hardness of checking the unichain condition in average cost MDPs
- Optimal cost almost-sure reachability in POMDPs
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
- Remote state estimation with usage-dependent Markovian packet losses
- Graph planning with expected finite horizon
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
- Nonapproximability results for partially observable Markov decision processes
- The complexity of optimal small policies
- Empirical dynamic programming
- Robust control of partially observable failing systems
- When is a pair of matrices mortal?
- Approximation algorithms for stochastic combinatorial optimization problems
- A Markovian process modeling for Pickomino
- Computational complexity in Markov decision theory
- Partially observable Markov decision processes and periodic policies with applications
- Graph Games and Reactive Synthesis
- Concavely-Priced Probabilistic Timed Automata
- Quantitative verification and strategy synthesis for stochastic games
- Myopic bounds for optimal policy of POMDPs: an extension of lovejoy's structural results
- Complexity of finite-horizon Markov decision process problems
- The simplex method is strongly polynomial for deterministic Markov decision processes
- scientific article; zbMATH DE number 4156195 (Why is no real title available?)
- On the complexity of finite memory policies for Markov decision processes
- Parallel Markov decision processes
- Probabilistic Acceptors for Languages over Infinite Words
- Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations
- Optimal eviction policies for stochastic address traces
- Hybrid answer set programming
- scientific article; zbMATH DE number 17813 (Why is no real title available?)
- A survey of stochastic -regular games
- scientific article; zbMATH DE number 549928 (Why is no real title available?)
- Model-based learning of interaction strategies in multi-agent systems
- Exploiting symmetries for single- and multi-agent partially observable stochastic domains
- Reachability switching games
- Bayesian decision making in groups is hard
- Probabilistic timed automata with one clock and initialised clock-dependent probabilities
- Probabilistic timed automata with one clock and initialised clock-dependent probabilities
- An Incremental Fast Policy Search Using a Single Sample Path
- Model checking linear-time properties of probabilistic systems
- Safe and optimal scheduling for hard and soft tasks
- On the Complexity of Value Iteration
- Markov decision process-based potential field technique for UAV planning
- A theory of strict P-completeness
- Markov decision processes with incomplete information and semiuniform Feller transition probabilities
- Optimal Switching Sequence for Switched Linear Systems
- Probabilistic disclosure: maximisation vs. minimisation
- Partial-observation stochastic games, how to win when belief fails
- Approximate equivalence of Markov decision processes.
- scientific article; zbMATH DE number 2189770 (Why is no real title available?)
- A New Complexity Result on Solving the Markov Decision Problem
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
- Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
- The Limitations of Optimization from Samples
- A survey of computational complexity results in systems and control
- Exact decomposition approaches for Markov decision processes: a survey
- Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions
- A discrete-time optimal execution problem with market prices subject to random environments
- Risk-aware shielding of partially observable Monte Carlo planning policies
- Future memories are not needed for large classes of POMDPs
- From Reinforcement Learning to Deep Reinforcement Learning: An Overview
- Separation of learning and control for cyber-physical systems
- On the complexity of computational problems associated with simple stochastic games
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
- Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information
- Optimality guarantees for particle belief approximation of POMDPs
- Planning and learning in partially observable systems via filter stability
- Optimistic MLE: a generic model-based algorithm for partially observable sequential decision making
- Decentralized MDPs with sparse interactions
- Deterministic weighted automata under partial observability
- The complexity of uncertainty in Markov decision processes
- ``Guess what I'm doing: extending legibility to sequential decision tasks
This page was built for publication: The Complexity of Markov Decision Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780028)
