# A Dynamic Program for a Team of Two Agents with Nested Information

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Mar 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)
- [A Decentralized Partially Observable Team Decision Methodology with Delayed Information Sharing](https://mlsanity.com/paper/2609.26783/) (2026)

## Abstract (arXiv)

In this paper, we investigate a sequential dynamic team problem consisting of two agents with a nested information structure. We use a combination of the person-by-person and prescription approach to derive structural results for optimal control strategies for the team. We then use these structural results to present a dynamic programming (DP) decomposition to derive the optimal control strategies for a finite time horizon. We show that our DP utilizes the nested information structure to simplify the computation of the optimal control laws for the team at the final time step.