AI Paper Atlas

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

Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games

AAAI 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Zero-sum game learning dynamics · 50 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
increase pursuit-evasion grid width from N=3 to N=6HSVI for one-sided POSGs · Pursuit-evasion 3xNruntime: 9s -> 3.5 hoursHurt
use 1-1 defender configuration instead of 2-1 in intrusion searchHSVI for one-sided POSGs · Intrusion searchruntime: 27 minutes (4656 states, 2-1) vs 3.5 hours (964 states, 1-1)Hurt
increase patrolling attack time from 3 to 4HSVI for one-sided POSGs · Patrolling ER(0.25)solved instances: all solved in <12 minutes -> 60% solved at |V|=13Hurt

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