Research map / Learning theory and algorithms / Submodular and game algorithms
A Memetic Approach for Sequential Security Games on a Plane with Moving Targets
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 |
|---|---|---|---|
| add local optimization phase to genetic algorithm (MA vs GA) (ablation) | Memetic Algorithm · 3000 preliminary security games | Defender payoff: GA lower by 0.38 on average | Helped |
| use MA instead of exact DOBSS | security games on a plane · 605 DOBSS-solvable games | optimal payoff match: 599 of 605 optimal | No clear effect |
| use MA instead of SMOS modification (s=1,2,4) | security games on a plane · Defender payoff difference | Defender payoff | Helped |
| increase number of targets/defenders for MILP methods vs MA | DOBSS and SMOS vs MA · scalability | runtime | Helped |
Closest papers by meaning
- Security Games on a Plane (AAAI 2017 · similarity 0.88)
- Scalable Solutions to Zero-Sum Partially Observable Stochastic Games Through Belief Aggregation with Approximation Guarantees (AAAI 2026 · similarity 0.85)
- Counterfactual Regret Minimization in Sequential Security Games (AAAI 2016 · similarity 0.85)
- Non-Additive Security Games (AAAI 2017 · similarity 0.84)
- Commitment to Sparse Strategies in Two-Player Games (AAAI 2025 · similarity 0.84)
- GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms (NeurIPS 2025 · similarity 0.84)
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.