A bound for a class of non-nested LQG team problems (Q1072907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bound for a class of non-nested LQG team problems |
scientific article; zbMATH DE number 3943492
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound for a class of non-nested LQG team problems |
scientific article; zbMATH DE number 3943492 |
Statements
A bound for a class of non-nested LQG team problems (English)
0 references
1986
0 references
A new method is presented to find a lower bound for a class of non-nested LQG team problems. This is achieved by: firstly, transforming the cost function into three decoupled components; secondly, decoupling the three subproblems via a power constraint; and thirdly, obtaining the lower bound of the original problem from an associated parameter optimization problem, which glues the subproblems together.
0 references
group decision making
0 references
lower bound
0 references
non-nested LQG team problems
0 references
