Abstract
This paper presents algorithms for converting multi-agent planning (MAP) problems described in Multi-Agent Planning Domain Definition Language (MA-PDDL) to extensive-form games in order to analyse and solve them with game-theoretic tools in general. MA-PDDL is an attempt to standardize the description of MAP problems similarly to PDDL in the single-agent setting. In this paper MA-PDDL is extended with partialobservability and probabilistic-effects to model more realistic domains. The conversion is fruitful in both ways: 1) extensive-form games can be solved via game-theoretic solution concepts (e.g. Nash-equilibrium) providing solutions to corresponding MAP problems in general, and 2) MA-PDDL problems can be solved via MAP methods providing solutions to corresponding games. Both cooperative and non-cooperative solutions can be achieved.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
