This paper presents conversion methods of fully- and partially-observable multi-agent
planning problems described in the Multi-Agent Planning Domain Definition Language
(MA-PDDL) to extensive-form games. MA-PDDL and extensive-form games model essentially
the same multi-agent situations, but the former is much more detailed. The proposed
conversion is fruitful in both directions: 1) extensive games can be solved via available
game theoretic solution principles providing solutions to corresponding MA-PDDL models,
and 2) MA-PDDL can be solved via multi-agent planning methods providing solutions
to the corresponding game.