Research map / Bandits and online learning / Online convex optimization and games
Counterfactual Regret Minimization in Sequential 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use NFGSS-CFR+ instead of double oracle | Transit game · width 12, precision 0.01 | time to precision: almost 10 hours -> 119 minutes | Helped |
| use NFGSS-CFR+ instead of LP | Ticket inspection game · largest, precision 0.01 | time to precision: almost 226 minutes -> 74 minutes | Helped |
| use NFGSS-CFR+ instead of double oracle | Transit game · very high precision (0.001) | time to precision | Hurt |
| use CFR+ instead of CFR (ablation) | NFGSS solver · Ticket inspection game | convergence speed | Helped |
| use CFR+ mean strategy vs current strategy (ablation) | NFGSS-CFR+ · Transit game | convergence speed | Helped |
Closest papers by meaning
- Regret Minimization in Behaviorally-Constrained Zero-Sum Games (ICML 2017 · similarity 0.91)
- Solving Large Extensive-Form Games with Strategy Constraints (AAAI 2019 · similarity 0.90)
- Strategy-Based Warm Starting for Regret Minimization in Games (AAAI 2016 · similarity 0.90)
- Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games (AAAI 2021 · similarity 0.89)
- Solving Imperfect-Information Games via Discounted Regret Minimization (AAAI 2019 · similarity 0.89)
- Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play (NeurIPS 2024 · similarity 0.88)
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.