Research map / Learning theory and algorithms / Submodular and game algorithms
Equilibrium Computation and Robust Optimization in Zero Sum Games With Submodular Structure
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 EQUATOR instead of SNARES | Network security games on random geometric graphs, varying network size · Random geometric graphs | defender utility: within 6% | Mixed |
| Use EQUATOR instead of SNARES | Network security games with varying numbers of sources and targets · Random geometric graphs | defender utility: within 4% | Mixed |
| Use EQUATOR instead of SNARES | Network security games with 250-node graphs · Random geometric graphs | runtime: 10 hours; 1000 nodes | Helped |
| Use EQUATOR instead of SNARES | Network security games with 20 source/targets · Random geometric graphs | runtime: 10 hours; under 25 seconds | Helped |
| Use EQUATOR instead of double oracle | Robust budget allocation on random bipartite graphs · Random robust budget allocation | worst-case profit: within 7% | Mixed |
| Use EQUATOR instead of double oracle | Robust budget allocation on random bipartite graphs with n = 1000 · Random robust budget allocation | runtime: 10 hours; less than 30 seconds | Helped |
| Optimize nominal expected return with greedy rather than robustly optimizing | Greedy advertiser allocation · Random robust budget allocation | worst-case profit: approximately 40% less robust | Hurt |
| Use EQUATOR instead of double oracle | Robust budget allocation on Yahoo Webscope data · Yahoo Webscope budget allocation | robust solution value: within 8% | Mixed |
| Use EQUATOR instead of double oracle | Robust budget allocation on Yahoo Webscope data · Yahoo Webscope budget allocation | runtime: 10 hours; under 40 seconds | Helped |
| Use robust optimization instead of nominal greedy allocation | Greedy advertiser allocation · Yahoo Webscope budget allocation | worst-case profit: no profit; |L| > 20 | Helped |
Closest papers by meaning
- Computing Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Games (AAAI 2020 · similarity 0.89)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.89)
- Roping in Uncertainty: Robustness and Regularization in Markov Games (ICML 2024 · similarity 0.87)
- Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games (ICML 2025 · similarity 0.87)
- Commitment to Sparse Strategies in Two-Player Games (AAAI 2025 · similarity 0.87)
- Robust Equilibria in Continuous Games: From Strategic to Dynamic Robustness (NeurIPS 2025 · similarity 0.87)
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.