摘要: This paper considers the question "when can a dynamic team problem be decomposed into several smaller problems?" A is partitioned groups of members. Precedence relation nd nestedness information among these are defined. Then concepts independent partition and sequential introduced, which partitions satisfying some conditions on their precedence relation, cost function. It shown that if has an (sequential) partition, (related) subproblems. also finest unique. In addition, decomposition decentralized control problems discussed.