Research map / Learning theory and algorithms / Submodular and game algorithms
Practical Frank–Wolfe Method with Decision Diagrams for Computing Wardrop Equilibrium of Combinatorial Congestion 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
- Differentiable Equilibrium Computation with Decision Diagrams for Stackelberg Models of Combinatorial Congestion Games (NeurIPS 2021 · similarity 0.91)
- The Complexity of Optimizing Atomic Congestion (AAAI 2024 · similarity 0.87)
- Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos (NeurIPS 2017 · similarity 0.86)
- Information Design for Congestion Games with Unknown Demand (AAAI 2024 · similarity 0.85)
- Enhancing the Efficiency of Altruism and Taxes in Affine Congestion Games through Signalling (AAAI 2024 · similarity 0.84)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.83)
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.