AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

AAAI 2016 · Reinforcement learning › MDPs and planning · approach: Robust MDP policy gradient · 24 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
exploit anonymous influence via redundant representation (RR-ALP) instead of standard ALPALP for factored MMDPs · Disease control, 10 random 30-node graphsALP solution time: average relative runtime 0.16 of originalHelped
exploit anonymous influence in variable elimination (RR-VE vs VE)variable elimination · Disease control, random graphsVE time: average relative 0.25; graph 1: 6.2s -> 1.5sHelped
use redundant representation instead of standard factor tablesALP constraint set · Disease control, random graphsconstraint set size: average relative size 0.53Helped
RR-ALP on denser graph (out-degree up to 20)RR-ALP · Disease control, out-degree [1,20] graphsolvability: 124.7s, 5816731 constraintsHelped
RR-ALP policy vs reactive copystate heuristicdisease control policy · 50 nodes, 25 agentsmean return: roughly a factor of 3Helped
RR-ALP policy vs copystate heuristicdisease control policy · 30 nodes, 15 agentsmean returnHelped

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