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.
@article{arxiv.2103.10028,
title = {A Dynamic Program for a Team of Two Agents with Nested Information},
author = {Aditya Dave and Andreas A. Malikopoulos},
journal= {arXiv preprint arXiv:2103.10028},
year = {2022}
}