Sufficient statistics in team control problems with a common past

Abstract
A team control problem is considered, whose information structure is partially nested and is characterized by the existence of a common past. It is shown that, under LQG hypotheses, the common past can be "condensed" in sufficient statistics, thus yielding optimal linear strategies whose arguments do not increase with time.

This publication has 0 references indexed in Scilit: