






















The paper bridges two vast areas of research: stochastic team decision problems and convex stochastic programming. New methods developed in the latter are applied to the study of fundamental problems in the former. The main results are concerned with the Lagrangian relaxation of informational and material constraints in convex stochastic team problems.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。