Research map / Learning theory and algorithms / Submodular and game algorithms
Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)
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 |
|---|---|---|---|
| solve possible evolutionarily-stable-winner problem with a MIP instead of brute-force search | possible ES winner problem in weak tournament games · random weak tournament games with n/2 or n unspecified entries | average solve time | Helped |
Closest papers by meaning
- Computing Game Symmetries and Equilibria That Respect Them (AAAI 2025 · similarity 0.87)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.87)
- The Complexity of Computing Robust Mediated Equilibria in Ordinal Games (AAAI 2024 · similarity 0.87)
- Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies (NeurIPS 2025 · similarity 0.86)
- Playing Markov Games Without Observing Payoffs (NeurIPS 2026 · similarity 0.86)
- Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity (AAAI 2025 · similarity 0.86)
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.