AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Payoff-Only Learning in Games via Best-Response Differential Inclusions

Ismail Hassan, Pedro G Lind, Anis Yazidi

NeurIPS 2026 · Learning theory and algorithms › Submodular and game algorithms · approach: Zero-sum game learning dynamics

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Analyzes an epochal payoff-only learning recursion for finite normal-form games, where each player uses only its own realized rewards and steps toward an empirical near-best vertex of a barrier simplex.

Problem

Learning in finite normal-form games when each player observes only its own realized reward, with opponents' actions and payoffs unknown.

Approach

An epochal recursion holds the mixed strategy fixed over long epochs, estimates own-action means from bandit data, and moves toward an empirical near-best vertex of a barrier simplex; the stochastic recursion is reduced to a best-response differential inclusion.

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