Research map / Bandits and online learning / Multi-armed bandits
Identify the Nash Equilibrium in Static Games with Random Payoffs
Yichi Zhou, Jialian Li, Jun Zhu
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 |
|---|---|---|---|
| Use LUCB-G (confidence-bound active sampling) instead of pulling all arms each round | two-player zero-sum static game with random payoffs · 5x5 synthetic games (with and without NE) | number of pulls | Improved |
| Use Racing (successive elimination) instead of pulling all arms each round | two-player zero-sum static game with random payoffs · 5x5 synthetic games (with and without NE) | number of pulls | Improved |
| Pulls on arms outside the row and column of the NE are kept bounded | Racing / LUCB-G on game with NE · 5x5 synthetic game with NE | number of pulls on arms outside nei(s*) | No clear effect |
Closest papers by meaning
- Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games (ICML 2019 · similarity 0.89)
- Learning with Bandit Feedback in Potential Games (NeurIPS 2017 · similarity 0.88)
- Optimal Rates for Feasible Payoff Set Estimation in Games (ICML 2026 · similarity 0.88)
- Learning Deviation Payoffs in Simulation-Based Games (AAAI 2019 · similarity 0.88)
- The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback (ICML 2025 · similarity 0.86)
- Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization (ICLR 2024 · 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.
