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

(2015) Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs. In: AAAI Fall Symposium on Sequential Decision Making in Intelligent Agents, November 12–14, 2015, Westin Arlington Gateway in Arlington, Virginia adjacent to Washington, DC. (Submitted)

There is a more recent version of this item available.

Text
Robbel15SDMIA.pdf - Unspecified
Access to this file is embargoed until Unspecified.
Download (344kB)

Official URL: http://www.aaai.org/Press/Reports/reports.php

Abstract

The Markov Decision Process (MDP) framework is a versatile method for addressing single and multiagent sequential decision making problems. Many exact and approximate solution methods attempt to exploit struc- ture in the problem and are based on value factoriza- tion. Especially multiagent settings (MAS), however, are known to suffer from an exponential increase in value component sizes as interactions become denser, meaning that approximation architectures are overly re- stricted in the problem sizes and types they can handle. We present an approach to mitigate this limitation for certain types of MASs, exploiting a property that can be thought of as ‘anonymous influence’ in the factored MDP. In particular, we show how anonymity can lead to representational and computational efficiencies, both for general variable elimination in a factor graph but also for the approximate linear programming solution to factored MDPs. The latter allows to scale linear pro- gramming to factored MDPs that were previously un- solvable. Our results are shown for a disease control do- main over a graph with 50 nodes that are each connected with up to 15 neighbors.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	?? QA75 ??
Depositing User:	Symplectic Admin
Date Deposited:	06 Nov 2015 17:12
Last Modified:	17 Dec 2022 01:33
URI:	https://livrepository.liverpool.ac.uk/id/eprint/2035699