Comments and Corrections on the DP Equations of Paper "On Team Decision Problems With Nonclassical Information Structures"
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917531511422976 |
|---|---|
| author | Charalambous, Charalambos D. Guvercin, Umarbek Djouadi, Seddik |
| author_facet | Charalambous, Charalambos D. Guvercin, Umarbek Djouadi, Seddik |
| contents | The 2023 paper ``On Team Decision Problems With Nonclassical Information Structures'' [1] presented information states and dynamic programming (DP) equations for delayed sharing information patterns, based on the concept of person-by-person (PbP) optimality of static team theory. In particular, [Section IV, 1], Theorem 5 presents recursions of the information states and Theorem 7, eqn(57), eqn(58), presents DP equations, of each team member.
In this note we show that the proof of Theorem 5 and the DP eqn(57), eqn(58) of Theorem 7 of [1] are incorrect. Consequently, Lemma 8, Theorem 6, and the full statement of Theorem 7 in [1] are invalid, because their proofs rely on erroneous information states and the optimality of separated strategies (i.e., functions of the information states).
We further provide the correct DP equations for PbP optimality, thereby highlighting the subtleties and challenges inherent in the analysis of delayed sharing information patterns. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_25700 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Comments and Corrections on the DP Equations of Paper "On Team Decision Problems With Nonclassical Information Structures" Charalambous, Charalambos D. Guvercin, Umarbek Djouadi, Seddik Optimization and Control The 2023 paper ``On Team Decision Problems With Nonclassical Information Structures'' [1] presented information states and dynamic programming (DP) equations for delayed sharing information patterns, based on the concept of person-by-person (PbP) optimality of static team theory. In particular, [Section IV, 1], Theorem 5 presents recursions of the information states and Theorem 7, eqn(57), eqn(58), presents DP equations, of each team member. In this note we show that the proof of Theorem 5 and the DP eqn(57), eqn(58) of Theorem 7 of [1] are incorrect. Consequently, Lemma 8, Theorem 6, and the full statement of Theorem 7 in [1] are invalid, because their proofs rely on erroneous information states and the optimality of separated strategies (i.e., functions of the information states). We further provide the correct DP equations for PbP optimality, thereby highlighting the subtleties and challenges inherent in the analysis of delayed sharing information patterns. |
| title | Comments and Corrections on the DP Equations of Paper "On Team Decision Problems With Nonclassical Information Structures" |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2605.25700 |