Research map / Learning theory and algorithms / Submodular and game algorithms
Security Games on a Plane
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use PTAS instead of exact algorithm | SGP solver · Runtime vs number of targets | runtime | Helped |
| allow resources anywhere on the plane (SGP) instead of only at targets (SPE) | Security game defender · 100 targets, 20 resources | defender utility | Helped |
| higher payoff variance across targets | SPE as heuristic for SGP · 100 targets, 20 resources | SPE/SGP utility ratio | Helped |
Closest papers by meaning
- On the Inducibility of Stackelberg Equilibrium for Security Games (AAAI 2019 · similarity 0.89)
- Coalition Formation in Multi-defender Security Games (AAAI 2021 · similarity 0.88)
- Safe Search for Stackelberg Equilibria in Extensive-Form Games (AAAI 2021 · similarity 0.88)
- Non-Additive Security Games (AAAI 2017 · similarity 0.88)
- A Memetic Approach for Sequential Security Games on a Plane with Moving Targets (AAAI 2019 · similarity 0.88)
- GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.