@article{Horčík_Torralba_Rytíř_Chrpa_Edelkamp_2022, title={Optimal Mixed Strategies for Cost-Adversarial Planning Games}, volume={32}, url={https://ojs.aaai.org/index.php/ICAPS/article/view/19797}, DOI={10.1609/icaps.v32i1.19797}, abstractNote={This paper shows that domain-independent tools from classical planning can be used to model and solve a broad class of game-theoretic problems we call Cost-Adversarial Planning Games (CAPGs). We define CAPGs as 2-player normal-form games specified by a planning task and a finite collection of cost functions. The first player (a planning agent) strives to solve a planning task optimally but has limited knowledge about its action costs. The second player (an adversary agent) controls the actual action costs. Even though CAPGs need not be zero-sum, every CAPG has an associated zero-sum game whose Nash equilibrium provides the optimal randomized strategy for the planning agent in the original CAPG. We show how to find the Nash equilibrium of the associated zero-sum game using a cost-optimal planner via the Double Oracle algorithm. To demonstrate the expressivity of CAPGs, we formalize a patrolling security game and several IPC domains as CAPGs.}, number={1}, journal={Proceedings of the International Conference on Automated Planning and Scheduling}, author={Horčík, Rostislav and Torralba, Álvaro and Rytíř, Pavel and Chrpa, Lukáš and Edelkamp, Stefan}, year={2022}, month={Jun.}, pages={160-168} }