Research map / Learning theory and algorithms / Submodular and game algorithms
Computing the Strategy to Commit to in Polymatrix Games
Giuseppe De Nittis, Alberto Marchesi, Nicola Gatti
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| increase the number of players n | Algorithm 1 · Random OLTPGs | computing time | Hurt |
| increase the number of actions per player m with n fixed | Algorithm 1 · Random OLTPGs | computing time | Hurt |
| increase players from 3 to 10 | Algorithm 1 · Random OLTPGs | max actions per player solved: 65 -> 4 | Hurt |
Closest papers by meaning
- The Complexity of Computing Robust Mediated Equilibria in Ordinal Games (AAAI 2024 · similarity 0.87)
- The Complexity of Two-Team Polymatrix Games with Independent Adversaries (ICLR 2025 · similarity 0.86)
- Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games (NeurIPS 2024 · similarity 0.86)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.85)
- Robust Equilibria in Continuous Games: From Strategic to Dynamic Robustness (NeurIPS 2025 · similarity 0.85)
- Computing Game Symmetries and Equilibria That Respect Them (AAAI 2025 · similarity 0.85)
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.
