Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
From MaRDI portal
Recommendations
- Sample-based policy iteration for constrained DEC-POMDPs
- Column generation algorithms for constrained POMDPs
- scientific article; zbMATH DE number 3852821
- Resource-driven mission-phasing techniques for constrained agents in stochastic environments
- Learning algorithms for discounted MDPs with constraints
Cites work
- A comprehensive survey on safe reinforcement learning
- A concise introduction to decentralized POMDPs
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- A heuristic search approach to planning with continuous resources in stochastic domains
- A Linear Programming Approach to the Cutting-Stock Problem
- A sufficient statistic for influence in structured multiagent environments
- A survey of multi-objective sequential decision-making
- Anytime point-based approximations for large POMDPS
- Bayesian reinforcement learning: a survey
- Column generation algorithms for constrained POMDPs
- scientific article; zbMATH DE number 3128787 (Why is no real title available?)
- scientific article; zbMATH DE number 1348599 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1559451 (Why is no real title available?)
- scientific article; zbMATH DE number 2243376 (Why is no real title available?)
- scientific article; zbMATH DE number 2243398 (Why is no real title available?)
- scientific article; zbMATH DE number 2243413 (Why is no real title available?)
- Markov Decision Processes with Sample Path Constraints: The Communicating Case
- Maximal mean/standard deviation ratio in an undiscounted MDP
- On Finding Optimal Policies for Markov Decision Chains: A Unifying Framework for Mean-Variance-Tradeoffs
- Opportunistic spectrum access in unslotted primary systems
- Optimal policies for controlled Markov chains with a constraint
- Planning and acting in partially observable stochastic domains
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Resource allocation among agents with MDP-induced preferences
- Resource-driven mission-phasing techniques for constrained agents in stochastic environments
- The Complexity of Decentralized Control of Markov Decision Processes
- The Complexity of Markov Decision Processes
- The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
- Where are the hard knapsack problems?
Cited in
(5)- Sample-based policy iteration for constrained DEC-POMDPs
- Resource-driven mission-phasing techniques for constrained agents in stochastic environments
- Column generation algorithms for constrained POMDPs
- Collaborative cost multi-agent decision-making algorithm with factored-value Monte Carlo tree search and max-plus
- Resilient fully-distributed reinforcement learning for UAV swarms against general Byzantine attacks
This page was built for publication: Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856487)
