#StochasticControl >[!thm] Existence for N-agent team >For an N−agent static stochastic team problem satisfying the four hypotheses, there exists at least one team-optimal solution.
Cor
We can relax (c.1) into (c.1′) and the result still holds:
- (c.1′) Let Nh and Ns be two complementary subsets of N (i.e. Nh∪Ns=N, and Nh∩Ns=∅) s.t. Si is compact ∀i∈Nh and Sj≡Uj ∀j∈Ns. Assume that ∑j∈Ns∣uj∣→∞, L(ξ;u1,…,uN)→∞ a.s., for every fixed ui∈Si,i∈Nh.
Lemma (2.4.1)
Let L:Rm1×⋯×RmN→R be a convex (deterministic) loss function, with pbp optimal solution u∘:=(u1∘,…,uN∘). If L is continuously differentiable at u∘, then u∘ is globally (team) optimal.
Intuition
So all we need is our loss function to be differentiable at our pbp solution for it to also be team optimal.
Now, using this lemma and the definition of a Stationary Team Policy we can show the following:
Theorem (2.4.4)
For an N-agent static stochastic team problem, let
- The hypotheses (c.3) and (c.4) be satisfied;
- Si be an Open convex subset of a finite dimensional Vector Space for each i∈N;
- L(ξ;⋅) be convex and continuously differentiable on S:=S1×⋯×SN
Under these conditions, if the policy γ∘, taking values in S, is stationary, it is team-optimal.