PublicationsSolving Transition-Independent Multi-agent MDPs with Sparse Interactions (Extended version)Joris Scharpff, Diederik M. Roijers, Frans A. Oliehoek, Matthijs T. J. Spaan, and Mathijs M. de Weerdt. Solving Transition-Independent Multi-agent MDPs with Sparse Interactions (Extended version). arXiv:1511.09047, 2016. DownloadAbstractIn cooperative multi-agent sequential decision making under uncertainty, agents must coordinate to find an optimal joint policy that maximises joint value. Typical algorithms exploit additive structure in the value function, but in the fully-observable multi-agent MDP setting (MMDP) such structure is not present. We propose a new optimal solver for transition-independent MMDPs, in which agents can only affect their own state but their reward depends on joint transitions. We represent these dependencies compactly in conditional return graphs (CRGs). Using CRGs the value of a joint policy and the bounds on partially specified joint policies can be efficiently computed. We propose CoRe, a novel branch-and-bound policy search algorithm building on CRGs. CoRe typically requires less runtime than the available alternatives and finds solutions to problems previously unsolvable. BibTeX Entry@Misc{Scharpff16arxiv, author = {Joris Scharpff and Diederik M. Roijers and Frans A. Oliehoek and Matthijs T. J. Spaan and Mathijs M. de Weerdt}, title = {Solving Transition-Independent Multi-agent {MDPs} with Sparse Interactions (Extended version)}, howpublished = {arXiv:1511.09047}, year = 2016 } Note: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. Generated by bib2html.pl (written by Patrick Riley) on Thu Feb 29, 2024 16:15:45 UTC |