Research map / Learning theory and algorithms / Submodular and game algorithms
Practical exact algorithm for trembling-hand equilibrium refinements in 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
- Trembling-Hand Perfection and Correlation in Sequential Games (AAAI 2021 · similarity 0.93)
- Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium (NeurIPS 2021 · similarity 0.91)
- Extensive-Form Perfect Equilibrium Computation in Two-Player Games (AAAI 2017 · similarity 0.91)
- Perturbing Best Responses in Zero-Sum Games (AAAI 2026 · similarity 0.89)
- An Improved Quasi-Polynomial Algorithm for Approximate Well-Supported Nash Equilibria (AAAI 2019 · similarity 0.89)
- Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games (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.