# Decentralized Control of Two Agents with Nested Accessible Information

arXiv: https://arxiv.org/abs/2109.11648 · HTML: https://mlsanity.com/paper/2109.11648/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Sep 2021.

## Built on by (most cited first, 2 of 2)

- [Approximate Information States for Worst-Case Control and Learning in Uncertain Systems](https://mlsanity.com/paper/2301.05089/) (2023)
- [Worst-Case Control and Learning Using Partial Observations Over an Infinite Time-Horizon](https://mlsanity.com/paper/2303.16321/) (2023)

## Abstract (arXiv)

In this paper, we investigate a decentralized stochastic control problem with two agents, where a part of the memory of the second agent is also available to the first agent at each instance of time. We derive a structural form for optimal control strategies which allows us to restrict their domain to a set which does not grow in size with time. We also present a dynamic programming (DP) decomposition which can utilize our results to derive optimal strategies for arbitrarily long time horizons. Since obtaining optimal control strategies by solving this DP decomposition is computationally intensive, we present potential resolutions in the form of simplified strategies by imposing additional conditions on our model, and an approximation technique which can be used to implement our results with a bounded loss of optimality.