atlas

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

Exclusion Method for Finding Nash Equilibrium in Multiplayer Games

AAAI 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Correlated equilibria in sequential games · 15 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use exclusion method instead of uniform-strategy searchequilibrium finding · GAMUT Covariant r=-0.5% instances not solved: 16 -> 0Helped
use exclusion method instead of uniform-strategy searchequilibrium finding · GAMUT Polymatrix% instances not solved: 7 -> 0Helped
use exclusion method instead of uniform-strategy searchequilibrium finding · GAMUT Random graphicalaverage run time (s): 0.05 -> 35000Hurt
use exclusion method instead of uniform-strategy searchequilibrium finding · random games n=5 m=3% instances over time limit: 36 -> 46Mixed
use exclusion method instead of GAMBIT incomplete algorithmsequilibrium finding · GAMUT classescompletenessHelped
increase game size (players n or actions m)exclusion method · random gamesaverage run time (s): 0.04 -> 900Hurt

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