atlas

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

Incremental Multiple Oracle

NeurIPS 2026 · Learning theory and algorithms › Submodular and game algorithms · approach: Zero-sum game learning dynamics · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 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.

Proposes Incremental Multiple Oracle, a modification of the multiple oracle algorithm that computes approximate mixed Nash equilibria of continuous-action games while keeping fixed-size pure strategy sets per player.

Problem

Computing approximate mixed-strategy Nash equilibria of continuous-action games, where prior double/multiple oracle methods grow strategy sets and thus require unbounded memory.

Approach

Modifies the multiple oracle algorithm (an extension of double oracle to multiple players and continuous actions) so that each player's pure strategy set has fixed cardinality, requiring only constant memory.

Key results

Limitations

Experimental setup

Baselines: multiple oracle double oracle

Builds on: double oracle multiple oracle

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