Research map / Learning theory and algorithms / Submodular and game algorithms
Tree-Based Stochastic Optimization for Solving Large-Scale Urban Network Security Games
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.
Closest papers by meaning
- Solving Large-Scale Pursuit-Evasion Games Using Pre-trained Strategies (AAAI 2023 · similarity 0.87)
- GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms (NeurIPS 2025 · similarity 0.86)
- NSGZero: Efficiently Learning Non-exploitable Policy in Large-Scale Network Security Games with Neural Monte Carlo Tree Search (AAAI 2022 · similarity 0.86)
- Tree Search-Based Policy Optimization under Stochastic Execution Delay (ICLR 2024 · similarity 0.84)
- SPOT: Scalable Policy Optimization with Trees for Markov Decision Processes (NeurIPS 2025 · similarity 0.84)
- In Search of Trees: Decision-Tree Policy Synthesis for Black-Box Systems via Search (AAAI 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.