AI Paper Atlas

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

Solving Partially Observable Stochastic Games with Public Observations

AAAI 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving

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
increase attack time from t=3 to t=4PO-POSG algorithm · Patrollinginstances solved in under 20 minutes: 97 -> 82Hurt
skip Lipschitz envelope computationPO-POSG algorithm · PatrollingconvergenceNo clear effect
move from Patrolling to Lasertag domainPO-POSG algorithm · Lasertag 4x4instances terminated in 5h: 16 of 20 not terminatedHurt
reduce grid from 4x4 to 3x3PO-POSG algorithm · Lasertagsolve time: less than 8 secondsHelped
larger patrolling graph (11 to 13 vertices)PO-POSG algorithm · Patrolling t=4solve time (s): 307s -> 11004sHurt
pruning of alpha-beta vectorsPO-POSG algorithm · Patrolling 13-vertexvectors retained: 50404 -> 22126 prunedHelped
modify epsilon between iterations (eps_imm)PO-POSG algorithm · alltrial lengthMixed
switch from Patrolling to LasertagPO-POSG algorithm · pruning costruntime share of pruning: 5% -> 22%Hurt

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