The Gibbs lemma
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "The_Gibbs_lemma"
.

In game theory and in particular the study of Blotto games and operational research, the Gibbs Lemma is a result that is useful in maximization problems. It is named for Josiah Willard Gibbs.

Consider \phi=\sum_{i=1}^n f_i(x_i). Suppose φ is maximized, subject to \sum x_i=X and x_i\geq 0, at x^0=(x_1^0,\ldots,x_n^0). If the fi are differentiable, then the Gibbs Lemma states that there exists a λ such that

\begin{align}
f'_i(x_i^0)&=\lambda \mbox{ if } x_i^0>0\\
&\leq\lambda\mbox { if }x_i^0=0.
\end{align}

References

  • J. M. Danskin 1967. The Theory of Max-Min, Springer-Verlag; page 10.
content
 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
© jGames.co.uk 2007 (some content from Wikipedia under GDL ) !-- ValueClick Media 468x60 and 728x90 Banner CODE for jgames.co.uk -->
Your Ad Here