AI Paper Atlas

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

ICML 2017 · Bandits and online learning › Multi-armed bandits · approach: Pure exploration algorithms · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use LUCB-G (confidence-bound active sampling) instead of pulling all arms each roundtwo-player zero-sum static game with random payoffs · 5x5 synthetic games (with and without NE)number of pullsImproved
Use Racing (successive elimination) instead of pulling all arms each roundtwo-player zero-sum static game with random payoffs · 5x5 synthetic games (with and without NE)number of pullsImproved
Pulls on arms outside the row and column of the NE are kept boundedRacing / LUCB-G on game with NE · 5x5 synthetic game with NEnumber of pulls on arms outside nei(s*)No clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy