Develops a layered-graph approximation algorithm for near-optimal defender strategies in a dynamic Stackelberg crime interdiction game on transportation networks, showing faster computation than MILP with comparable quality.
Sequence-form algorithm for computing stackelberg equilibria in extensive-form games
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks
Develops a layered-graph approximation algorithm for near-optimal defender strategies in a dynamic Stackelberg crime interdiction game on transportation networks, showing faster computation than MILP with comparable quality.