Abstract

Markov decision process (MDP) provides a framework for computing optimal policies for individual agents operating in uncertain environments. However, extending single-agent MDP techniques to multiagent problems is not straightforward. Previous complexity analyses have shown that the general decentralized Markov decision process (Dec-MDP) is NEXP-complete, which means that optimally solving a Dec-MDP is extremely difficult. The class of problems studied in this paper is a subclass of Dec-MDP in which two or more cooperative agents are tied together through the rewards of completing joint tasks but the actions taken by one agent do not impact other agents' transitions. Although this reduces the complexity class to NP-complete [4], efficiently solving such transition independent Dec-MDPs is still nontrivial.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.