Gibbs lemma

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (May 2025) (Learn how and when to remove this message) This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (May 2025) (Learn how and when to remove this message) (Learn how and when to remove this message)

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.^[1] It is named for Josiah Willard Gibbs.

Consider ${\displaystyle \phi =\sum _{i=1}^{n}f_{i}(x_{i})}$. Suppose ${\displaystyle \phi }$ is maximized, subject to ${\displaystyle \sum x_{i}=X}$ and ${\displaystyle x_{i}\geq 0}$, at ${\displaystyle x^{0}=(x_{1}^{0},\ldots ,x_{n}^{0})}$. If the ${\displaystyle f_{i}}$ are differentiable, then the Gibbs lemma states that there exists a ${\displaystyle \lambda }$ such that

${\displaystyle {\begin{aligned}f'_{i}(x_{i}^{0})&=\lambda {\mbox{ if }}x_{i}^{0}>0\\&\leq \lambda {\mbox{ if }}x_{i}^{0}=0.\end{aligned}}}$

This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e

This game theory article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e