Optimal Mixed Strategies for Cost-Adversarial Planning Games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00359603" target="_blank" >RIV/68407700:21230/22:00359603 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/22:00359603
Result on the web
<a href="https://doi.org/10.1609/icaps.v32i1.19797" target="_blank" >https://doi.org/10.1609/icaps.v32i1.19797</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1609/icaps.v32i1.19797" target="_blank" >10.1609/icaps.v32i1.19797</a>
Alternative languages
Result language
angličtina
Original language name
Optimal Mixed Strategies for Cost-Adversarial Planning Games
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022
ISBN
978-1-57735-874-9
ISSN
2334-0835
e-ISSN
—
Number of pages
9
Pages from-to
160-168
Publisher name
AAAI Press
Place of publication
Menlo Park
Event location
Singapur
Event date
Jun 19, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—