The Complexity of Decentralized Control of Markov Decision Processes
From MaRDI portal
Recommendations
- The decentralized Markov parameters and the selection of control structures
- The computational complexity of decentralized discrete-event control problems
- Control of decentralized systems with distributed controller complexity
- Decentralized optimal control of Markov chains with a common past information set
- scientific article; zbMATH DE number 5547972
- Decentralized stochastic control
- An approximate dynamic programming approach to decentralized control of stochastic systems
- scientific article; zbMATH DE number 1054754
- scientific article; zbMATH DE number 3889411
- Game theoretic decentralized feedback controls in Markov jump processes
Cited in
(54)- A tutorial on partially observable Markov decision processes
- Probabilistic bisimulation for realistic schedulers
- Multi-robot inverse reinforcement learning under occlusion with estimation of state transitions
- A mean-variance optimization problem for discounted Markov decision processes
- Multi-agent reinforcement learning algorithm to solve a partially-observable multi-agent problem in disaster response
- Negotiating team formation using deep reinforcement learning
- An action language for multi-agent domains
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- A partially observable stochastic zero-sum game for a network epidemic control problem
- Knowledge-based strategies for multi-agent teams playing against nature
- Privacy stochastic games in distributed constraint reasoning
- A survey of inverse reinforcement learning: challenges, methods and progress
- The Hanabi challenge: a new frontier for AI research
- Recognizing and learning models of social exchange strategies for the regulation of social interactions in open agent societies
- A leader-follower partially observed, multiobjective Markov game
- Value of information for a leader-follower partially observed Markov game
- The complexity of reachability in parametric Markov decision processes
- A decentralised multi-agent system for rail freight traffic management
- Complexity of planning for connected agents in a partially known environment
- Distributed synthesis in continuous time
- Partially decentralized reinforcement learning in finite, multi-agent Markov decision processes
- Multiagent expedition with graphical models
- Environment-driven distributed evolutionary adaptation in a population of autonomous robotic agents
- Complexity of finite-horizon Markov decision process problems
- scientific article; zbMATH DE number 5547972 (Why is no real title available?)
- Exploiting symmetries for single- and multi-agent partially observable stochastic domains
- Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment
- Deep reinforcement learning for swarm systems
- A survey of opponent modeling in adversarial domains
- scientific article; zbMATH DE number 7625165 (Why is no real title available?)
- On the Complexity of Value Iteration
- Proactive Dynamic Distributed Constraint Optimization Problems
- Misinformation and disinformation in modern warfare
- Probabilistic bisimulation for realistic schedulers
- Infinite games with finite knowledge gaps
- Online planning for multi-agent systems with bounded communication
- scientific article; zbMATH DE number 2243368 (Why is no real title available?)
- Safe multi-agent pathfinding with time uncertainty
- Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
- Dynamic process scheduling and resource allocation in distributed environment: an agent-based modelling and simulation
- On the Complexity of Reachability in Parametric Markov Decision Processes
- TEAMSTER: model-based reinforcement learning for ad hoc teamwork
- Partially observed optimal control of local and remote controllers
- Provably efficient reinforcement learning in decentralized general-sum Markov games
- Decentralized MDPs with sparse interactions
- Collaborative cost multi-agent decision-making algorithm with factored-value Monte Carlo tree search and max-plus
- HSVI can solve zero-sum partially observable stochastic games
- Partially observable RL: benign structures and simple generic algorithms
- The complexity of pure maxmin strategies in two-player extensive-form games
- Answer set planning: a survey
- Modelling Opinion Dynamics at Scale with Deep MARL
- Factored planning in partially observable and deterministic multi-agent domains
- Safe learning of multi-agent action models from concurrent joint action observations
- The factored policy-gradient planner
This page was built for publication: The Complexity of Decentralized Control of Markov Decision Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704111)
