Exploiting Structure To Efficiently Solve Loosely Coupled Stochastic Games
نویسندگان
چکیده
This paper is concerned with sequential decision making by self-interested agents when their decision processes are largely independent. This situation can be formulated as a stochastic game which would traditionally be represented in extensive form (a single game tree), a representation that fails to exploit the loose coupling in the game. We propose a new representation for 2-agent loosely coupled stochastic games that allows exploiting the sparsity and structure of agent interactions while still being able to capture a general stochastic game. We provide analytical and experimental results to show the representational and computational savings we obtain compared to extensive form in settings with different degrees of coupling. Our second contribution is a compact formulation of our problem as a Multi-Agent Influence Diagram, a first step towards the goal of solving problems with more than two agents. Finally, we investigate the challenges that need to be resolved to meet this goal.
منابع مشابه
You Can Never Solve a Problem on the Level on Which It Was Created. a Stochastic Optimization Method for Partially Decomposable Problems, with Application to Analysis of Nmr Spectra Examining Committee
Many real-life optimization problems have structures that one may be able to exploit to solve theproblem efficiently. A common structure is partial decomposability, which decomposes the originalproblem into a set of weakly coupled sub-problems that are each relatively easy to solve. However,due to the coupling, the solution to each sub-problem must also incorporate information from ...
متن کاملPlanning for Weakly-Coupled Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a powerful framework for modeling multi-agent interactions. While elegant and expressive, the framework has been shown to be computationally intractable [Bernstein et al., 2002]. An exact dynamic programming algorithm for POSGs has been developed recently, but due to high computational demands, it has only been demonstrated to work on extrem...
متن کاملOptimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation problem and a policy optimization problem. We show how to combine the two problems into a single constrained optimization problem that yields optimal resource allocations and policies that are optimal under these allocat...
متن کاملThe Million-Variable "March" for Stochastic Combinatorial Optimization
Combinatorial optimization problems have applications in a variety of sciences and engineering. In the presence of data uncertainty, these problems lead to stochastic combinatorial optimization problems which result in very large scale combinatorial optimization problems. In this paper, we report on the solution of some of the largest stochastic combinatorial optimization problem consisting of ...
متن کاملDecomposition of loosely coupled integer programs: A multiobjective perspective
We consider integer programming (IP) problems consisting of (possibly a large number of) subsystems and a small number of coupling constraints that link variables from different subsystems. Such problems are called loosely coupled or nearly decomposable. Motivated by recent developments in multiobjective programming (MOP), we develop a MOP-based decomposition algorithm to solve loosely coupled ...
متن کامل