CISPA
Browse
27215-Article Text-31284-1-2-20230701.pdf (291.58 kB)

Lifted Stackelberg Planning.

Download (291.58 kB)
conference contribution
posted on 2024-02-08, 10:14 authored by Philipp Sauer, Marcel Steinmetz, Robert KünnemannRobert Künnemann, Jörg Hoffmann
In Stackelberg planning, a leader and a follower each choose a plan in the same planning task, the leader's objective being to maximize plan cost for the follower. This formulation naturally captures, among others, security-related scenarios where the leader defends an infrastructure against subsequent attacks by the follower. Indeed, Stackelberg planning has been applied to the analysis of email infrastructure security. At web scale, however, the planning tasks involved easily contain tens of thousands of objects, so that grounding becomes the bottleneck. Here we introduce a lifted form of Stackelberg planning to address this. We devise leader-follower search algorithms working at the level of the PDDL-style input model to the extent possible. Our experiments show that, in Stackelberg tasks with many objects, including in particular models of web infrastructure security, our lifted algorithms outperform grounded Stackelberg planning.

History

Editor

Koenig S ; Stern R ; Vallati M

Primary Research Area

  • Reliable Security Guarantees

Name of Conference

International Conference on Automated Planning and Scheduling (ICAPS)

Journal

ICAPS

Page Range

370-374

Publisher

AAAI Press

BibTeX

@conference{Sauer:Steinmetz:Künnemann:Hoffmann:2023, title = "Lifted Stackelberg Planning.", author = "Sauer, Philipp" AND "Steinmetz, Marcel" AND "Künnemann, Robert" AND "Hoffmann, Jörg", editor = "Koenig, Sven" AND "Stern, Roni" AND "Vallati, Mauro", year = 2023, month = 1, journal = "ICAPS", pages = "370--374", publisher = "AAAI Press" }

Usage metrics

    Categories

    No categories selected

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC