Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2101.10992 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911962274725888 |
|---|---|
| author | Malikopoulos, Andreas A. |
| author_facet | Malikopoulos, Andreas A. |
| contents | In this paper, we consider sequential dynamic team decision problems with nonclassical information structures. First, we address the problem from the point of view of a ``manager" who seeks to derive the optimal strategy of the team in a centralized process. We derive structural results that yield an information state for the team which does not depend on the control strategy, and thus it can lead to a dynamic programming decomposition where the optimization problem is over the space of the team's decisions. We, then, derive structural results for each team member that yield an information state which does not depend on their control strategy, and thus it can lead to a dynamic programming decomposition where the optimization problem for each team member is over the space of their decisions. Finally, we show that the solution of each team member is the same as the one derived by the manager. We present an illustrative example of a dynamic team with a delayed sharing information structure. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2101_10992 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | On Team Decision Problems with Nonclassical Information Structures Malikopoulos, Andreas A. Optimization and Control In this paper, we consider sequential dynamic team decision problems with nonclassical information structures. First, we address the problem from the point of view of a ``manager" who seeks to derive the optimal strategy of the team in a centralized process. We derive structural results that yield an information state for the team which does not depend on the control strategy, and thus it can lead to a dynamic programming decomposition where the optimization problem is over the space of the team's decisions. We, then, derive structural results for each team member that yield an information state which does not depend on their control strategy, and thus it can lead to a dynamic programming decomposition where the optimization problem for each team member is over the space of their decisions. Finally, we show that the solution of each team member is the same as the one derived by the manager. We present an illustrative example of a dynamic team with a delayed sharing information structure. |
| title | On Team Decision Problems with Nonclassical Information Structures |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2101.10992 |