Team problems and stochastic programming
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.