<blockquote>
<p>Couldn't it be that there's some allocation that is Pareto optimal that isn't the one that maximizes the first investor's expected utility? My understanding was that Pareto optimal just meant that there was no way to make one person better off without making another person worse off.</p>
</blockquote>
<p>Let me consider the case of a simple resource economy such that we don't have to bother with random variables or expected utilities. However the arguments carry directly over to that case also.</p>
<p>Let <span class="math-container">$W$</span> be the total amount of endowment available. The following gives the definition of a feasible allocation.</p>
<p><strong>Definition:</strong> we say that <span class="math-container">$(w_1, \ldots, w_H) \in \mathbb{R}^{nH}_+$</span> is a <strong>feasible allocation</strong> if <span class="math-container">$\sum_{i = 1}^H w_i = W$</span>, and we denote by <span class="math-container">$F$</span> the set of all feasible allocations.</p>
<p>Now, assume that each individual has a strictly increasing and continuous utility function <span class="math-container">$u_i: \mathbb{R}^n_+ \to \mathbb{R}$</span>.</p>
<p><strong>Definition:</strong> A feasible allocation <span class="math-container">$(w_1, \ldots, w_H) \in F$</span> is <strong>Pareto optimal</strong> if there does not exist another feasible allocation <span class="math-container">$(w_1',\ldots, w_H') \in F$</span> such that for all <span class="math-container">$i = 1,\ldots, H$</span>,
<span class="math-container">$$
u_i(w_i) \ge u_i(w_i'),
$$</span>
with at least one inequality strict.</p>
<p>Consider the set of all utility values that can be reached by the individuals <span class="math-container">$2$</span> up to <span class="math-container">$H$</span> for some feasible allocation.
<span class="math-container">$$
\overline{U} = \{(u_2(w_2), \ldots, u_H(w_H)) \in \mathbb{R}^{H-1}|\exists (w_1, w_2,\ldots, w_H) \in F)\}.
$$</span>
Fix values <span class="math-container">$(\overline{u}_2,\ldots, \overline{u}_{H}) \in \overline{U}$</span> and consider the problem of maximising the utility of individual 1 subject to the constraint that the utilities of all other agents should be at least equal to their utility in the vector <span class="math-container">$\overline{U}$</span>:
<span class="math-container">$$
\begin{align*}
\max_{w_1, \ldots, w_H} &amp;u_1(w_1), \tag{1}\\
\text{ subject to } &amp;\sum_{i = 1}^H w_i = W,\\
&amp; u_h(w_h) \ge \overline{u}_h, \forall h = 2,\ldots, H
\end{align*}
$$</span>
In some sense, this problem fixed the utility values of all but one individual at <span class="math-container">$\overline{u}_h$</span>. Then it looks for the allocation that maximizes the utility of the first individual. Any such solution should be Pareto optimal, as otherwise individual 1 should be able to get a higher utility. This is shown in the following theorem.</p>
<p><strong>Theorem</strong> Assume the utility functions <span class="math-container">$u_1(.), \ldots, u_H(.)$</span> are strictly monotone and continuous. Then <span class="math-container">$(w_1^\ast, \ldots, w_H^\ast) \in F$</span> is Pareto optimal if and only if there exist values <span class="math-container">$(\overline{u}_2,\ldots, \overline{u}_H) \in \overline{U}$</span> such that <span class="math-container">$(w_1^\ast, \ldots, w_H^\ast)$</span> solves <span class="math-container">$(1)$</span>.</p>
<p><em>Proof:</em> Let <span class="math-container">$(w_1^\ast, \ldots, w_H^\ast) \in F$</span> be Pareto optimal. Define <span class="math-container">$\overline{u}_h = u_h(w_h^\ast)$</span> for all <span class="math-container">$h = 2,\ldots, H$</span>. We have that <span class="math-container">$(\overline{u}_2,\ldots, \overline{u}_H) \in \overline{U}$</span>. Then if <span class="math-container">$(w_1^\ast, \ldots, w_H^\ast)$</span> does not solve <span class="math-container">$(1)$</span>, there must be an allocation <span class="math-container">$(w_1, \ldots, w_H) \in F$</span> such that for <span class="math-container">$h \in \{2,\ldots, H\}$</span>:
<span class="math-container">$$
u_h(w_h) \ge \overline{u}_h = u_h(w_h^\ast)
$$</span>
and:
<span class="math-container">$$
u_1(w_1) &gt; u_1(w_1^\ast).
$$</span>
However, this implies that <span class="math-container">$(w_1, \ldots, w_H)$</span> Pareto dominates the allocation <span class="math-container">$(w_1^\ast, \ldots, w_H^\ast)$</span>, a contradiction.</p>
<p>For the reverse, assume that <span class="math-container">$(w_1^\ast,\ldots, w_H^\ast) \in F$</span> solves <span class="math-container">$(1)$</span> and assume, towards a contradiction that there is an allocation <span class="math-container">$(w_1, \ldots, w_H) \in F$</span> that Pareto dominates <span class="math-container">$(w_1^\ast, \ldots, w_H^\ast)$</span>. This gives that for all <span class="math-container">$h \in \{2,\ldots, H\}$</span>:
<span class="math-container">$$
u_h(w_h) \ge u_h(w^\ast_h) \ge \overline{u}_h,
$$</span>
and
<span class="math-container">$$
u_1(w_1) \ge u_1(w_1^\ast),
$$</span>
with at least one inequality strict. If the strict inequality is for agent <span class="math-container">$1$</span>, then we see that <span class="math-container">$(w_1, \ldots, w_H)$</span> improves upon the solution <span class="math-container">$(w_1^\ast, \ldots w_H^\ast)$</span> for problem <span class="math-container">$(1)$</span> which is a contradiction. As such, assume that <span class="math-container">$u_k(w_k) &gt; u_h(w_k^\ast) \ge \overline{u}_k$</span> for some <span class="math-container">$k \ne 1$</span>.</p>
<p>Given this, by strict monotonicity, there must be at least one good in <span class="math-container">$w_k$</span> whose amount is strictly above the amount in <span class="math-container">$w_k^\ast$</span>. Let <span class="math-container">$j$</span> be this good and let <span class="math-container">$1_j$</span> be the vector of all zeros except at position <span class="math-container">$j$</span>.</p>
<p>Now take a <span class="math-container">$\varepsilon &gt; 0$</span> small enough such that:
<span class="math-container">$$
u_k(w_k - \varepsilon 1_j) \ge \overline{u}_k,
$$</span>
Such <span class="math-container">$\varepsilon&gt; 0$</span> can be found as <span class="math-container">$u_k$</span> is continuous. Then define <span class="math-container">$(\hat w_1, \ldots, \hat w_H) \in F$</span>  such that <span class="math-container">$\hat w_1 = w_1 + \varepsilon 1_j$</span>, <span class="math-container">$\hat w_k = w_k - \varepsilon 1_j$</span> and <span class="math-container">$\hat w_h = w_h$</span> for all <span class="math-container">$h \in \{2,\ldots, H\} \setminus \{k\}$</span>. Then we have that for all <span class="math-container">$h \in \{2,\ldots H\}$</span>:
<span class="math-container">$$
u_h(\hat w_h) \ge \overline{u}_h,
$$</span>
and,
<span class="math-container">$$
u_1(\hat w_1) &gt; u_1(w_1) \ge u_1(w_1^\ast)
$$</span>
this means that <span class="math-container">$(\hat w_1,\ldots, \hat w_H)$</span> provides a better solution to <span class="math-container">$(1)$</span> compared to <span class="math-container">$(w_1^\ast, \ldots, w_H^\ast)$</span> which contradicts optimality of the latter. <span class="math-container">$\square$</span></p>
<blockquote>
<p>Because of concavity, the optimum for (4.1) maximizes the Lagrangean.&quot; I don't see what concavity has to do with this or why it is that the optimum for (4.1) also maximizes the Lagrangean.</p>
</blockquote>
<p>The Langrangian first order conditions are sufficient if the objective function is concave and the constraints produce a convex set. This is true if the utility functions are concave. If you don't know how to get from an optimization problem to the Lagrangian (and vice versa), there are many resources online.</p>
<blockquote>
<p>In the previous step, the indexing of the constraint terms with the lagrange multipliers started at 2, not 1. And how are we showing that the Pareto optimum solves this maximization problem? I don't see how this follows from the previous step.</p>
</blockquote>
<p>Consider the Lagrangian corresponding to <span class="math-container">$(1)$</span>:
<span class="math-container">$$
(w_1^\ast, \ldots, w_H^\ast) \in \arg\max_{w_1, \ldots, w_H} u_1(w_1) + \sum_{i = 2}^H \lambda^i [u_i(w_i) - \overline{u}_h] + \mu\left[ \sum_{i = 1}^H w_i - W\right]
$$</span>
Here I explicitly added the constraint set to the problem. In your case, it is already substituted for into the utility function of the first individual.</p>
<p>Now, let us define <span class="math-container">$\lambda_1 = 1$</span>. Then we can rewrite the Lagrangian optimisation problem as:
<span class="math-container">$$
(w_1^\ast, \ldots, w_H^\ast) \in \arg\max_{w_1, \ldots, w_H} \sum_{i = 1}^H \lambda_i u_i(w_i) + \mu \left[\sum_{i = 1}^H w_i - W\right] - \sum_{i = 2}^H \lambda_i \overline{u}_h.
$$</span>
The last sum is a constant term. So deleting it from this problem does not change the optimal solution. This gives:
<span class="math-container">$$
(w_1^\ast, \ldots, w_H^\ast) \in \arg\max_{w_1, \ldots w_H} \sum_{i = 1}^H \lambda_i u_i(w_i) + \mu\left[\sum_{i = 1}^H w_i - W\right].
$$</span>
Now, fixing the values <span class="math-container">$(\lambda_1,\ldots, \lambda_H)$</span>, this is the Lagrangian corresponding to the following optimization problem:
<span class="math-container">$$
\begin{align*}
\max_{w_1,\ldots, w_H} &amp;\sum_{i = 1}^H \lambda_i u_i(w_i),\\
\text{ subject to: } &amp; \sum_{i = 1}^H w_i = W.
\end{align*}
$$</span>
This problem maximises a weighted sum of utilities subject to the resource constraint. This is in fact a more general result. If all utility functions are continuous strictly monotonic and concave then every Pareto efficient allocation results from the maximisation of some weighted sum of the utilities of all the individuals in the economy. The proof of this relies on a supporting hyperplane argument.</p>

CC BY-SA 4.0
2021-09-20T06:05:15.257Z
2021-09-20T06:05:15.257Z
tdm
<p>I'm reading a passage from <em>Asset Pricing and Portfolio Choice Theory</em> by Kerry Back, and I don't understand some of it. I would appreciate any help anyone could provide me.</p>
<p>In the passage, Back is proving that a Pareto optimum maximizes a weighted average of utility functions, and we are assuming that the utility functions are concave (representing risk averse investors).</p>
<p>From the text: &quot;Consider an allocation <span class="math-container">$(\tilde{w_1}', ..., \tilde{w_H}')$</span>. Define <span class="math-container">$\bar{u_h} = E[u_h(\tilde{w_h}')]$</span>. If the allocation is Pareto optimal, then it must solve <span class="math-container">$\max_{\tilde{w_2}, ..., \tilde{w_H}} E[u_1(\tilde{w_m} - \sum_{h=2}^H \tilde{w_h})]$</span> subject to <span class="math-container">$E[u_h(\tilde{w_h})] \geq \bar{u_h}$</span> for <span class="math-container">$h = 2, ..., H$</span>. (4.1)&quot; Here, <span class="math-container">$\tilde{w_m}$</span> is the market (total) wealth, i.e. the sum of the wealths of the <span class="math-container">$H$</span> individual investors, and it's a random variable. I don't see why this statement is true. Couldn't it be that there's some allocation that is Pareto optimal that isn't the one that maximizes the first investor's expected utility? My understanding was that Pareto optimal just meant that there was no way to make one person better off without making another person worse off.</p>
<p>More from the text: &quot;The Lagrangean for this problem is <span class="math-container">$\max_{\tilde{w_2}, ..., \tilde{w_H}} E[u_1(\tilde{w_m} - \sum_{h=2}^H \tilde{w_h})] + \sum_{h=2}^H \lambda_h E[u_h(\tilde{w_h})] - \sum_{h=2}^H \lambda_h \bar{u_h}$</span>. Because of concavity, the optimum for (4.1) maximizes the Lagrangean.&quot; I don't see what concavity has to do with this or why it is that the optimum for (4.1) also maximizes the Lagrangean.</p>
<p>More from the text: &quot;Taking <span class="math-container">$\lambda_1 = 1$</span> shows that a Pareto-optimal allocation must solve <span class="math-container">$\max \sum_{h=1}^H \lambda_h E[u_h(\tilde{w_h})]$</span> subject to <span class="math-container">$\sum_{h=1}^H \tilde{w_h} = \tilde{w_m}$</span> (4.2) for some <span class="math-container">$(\lambda_1, ..., \lambda_H)$</span>.&quot; Of course, I see that this is the conclusion we want, but I don't see how it follows from the previous step. There wasn't explicitly a <span class="math-container">$\lambda_1$</span> in the previous step, so where are we taking <span class="math-container">$\lambda_1 = 1$</span>? In the previous step, the indexing of the constraint terms with the lagrange multipliers started at 2, not 1. And how are we showing that the Pareto optimum solves this maximization problem? I don't see how this follows from the previous step.</p>
<p>Thank you for any help! I'd really appreciate it!</p>

<utility><expected-utility><pareto-efficiency><lagrangian>
How does this imply that a Pareto optimum maximizes a weighted average of utility functions?
Ben Phronesis
# How does this imply that a Pareto optimum maximizes a weighted average of utility functions?

(Asked by: username_0 on 2021-09-19)

I'm reading a passage from *Asset Pricing and Portfolio Choice Theory* by Kerry Back, and I don't understand some of it. I would appreciate any help anyone could provide me.

In the passage, Back is proving that a Pareto optimum maximizes a weighted average of utility functions, and we are assuming that the utility functions are concave (representing risk averse investors).

From the text: "Consider an allocation $(\tilde{w\_1}', ..., \tilde{w\_H}')$. Define $\bar{u\_h} = E[u\_h(\tilde{w\_h}')]$. If the allocation is Pareto optimal, then it must solve $\max\_{\tilde{w\_2}, ..., \tilde{w\_H}} E[u\_1(\tilde{w\_m} - \sum\_{h=2}^H \tilde{w\_h})]$ subject to $E[u\_h(\tilde{w\_h})] \geq \bar{u\_h}$ for $h = 2, ..., H$. (4.1)" Here, $\tilde{w\_m}$ is the market (total) wealth, i.e. the sum of the wealths of the $H$ individual investors, and it's a random variable. I don't see why this statement is true. Couldn't it be that there's some allocation that is Pareto optimal that isn't the one that maximizes the first investor's expected utility? My understanding was that Pareto optimal just meant that there was no way to make one person better off without making another person worse off.

More from the text: "The Lagrangean for this problem is $\max\_{\tilde{w\_2}, ..., \tilde{w\_H}} E[u\_1(\tilde{w\_m} - \sum\_{h=2}^H \tilde{w\_h})] + \sum\_{h=2}^H \lambda\_h E[u\_h(\tilde{w\_h})] - \sum\_{h=2}^H \lambda\_h \bar{u\_h}$. Because of concavity, the optimum for (4.1) maximizes the Lagrangean." I don't see what concavity has to do with this or why it is that the optimum for (4.1) also maximizes the Lagrangean.

More from the text: "Taking $\lambda\_1 = 1$ shows that a Pareto-optimal allocation must solve $\max \sum\_{h=1}^H \lambda\_h E[u\_h(\tilde{w\_h})]$ subject to $\sum\_{h=1}^H \tilde{w\_h} = \tilde{w\_m}$ (4.2) for some $(\lambda\_1, ..., \lambda\_H)$." Of course, I see that this is the conclusion we want, but I don't see how it follows from the previous step. There wasn't explicitly a $\lambda\_1$ in the previous step, so where are we taking $\lambda\_1 = 1$? In the previous step, the indexing of the constraint terms with the lagrange multipliers started at 2, not 1. And how are we showing that the Pareto optimum solves this maximization problem? I don't see how this follows from the previous step.

Thank you for any help! I'd really appreciate it!

**Tags:** utility, expected-utility, pareto-efficiency, lagrangian


---

## 1 answers

### Answer by username_1 on 2021-09-20. Score: 3

> Couldn't it be that there's some allocation that is Pareto optimal that isn't the one that maximizes the first investor's expected utility? My understanding was that Pareto optimal just meant that there was no way to make one person better off without making another person worse off.

Let me consider the case of a simple resource economy such that we don't have to bother with random variables or expected utilities. However the arguments carry directly over to that case also.

Let $W$ be the total amount of endowment available. The following gives the definition of a feasible allocation.

**Definition:** we say that $(w\_1, \ldots, w\_H) \in \mathbb{R}^{nH}\_+$ is a **feasible allocation** if $\sum\_{i = 1}^H w\_i = W$, and we denote by $F$ the set of all feasible allocations.

Now, assume that each individual has a strictly increasing and continuous utility function $u\_i: \mathbb{R}^n\_+ \to \mathbb{R}$.

**Definition:** A feasible allocation $(w\_1, \ldots, w\_H) \in F$ is **Pareto optimal** if there does not exist another feasible allocation $(w\_1',\ldots, w\_H') \in F$ such that for all $i = 1,\ldots, H$,
$$
u\_i(w\_i) \ge u\_i(w\_i'),
$$
with at least one inequality strict.

Consider the set of all utility values that can be reached by the individuals $2$ up to $H$ for some feasible allocation.
$$
\overline{U} = \{(u\_2(w\_2), \ldots, u\_H(w\_H)) \in \mathbb{R}^{H-1}|\exists (w\_1, w\_2,\ldots, w\_H) \in F)\}.
$$
Fix values $(\overline{u}\_2,\ldots, \overline{u}\_{H}) \in \overline{U}$ and consider the problem of maximising the utility of individual 1 subject to the constraint that the utilities of all other agents should be at least equal to their utility in the vector $\overline{U}$:
$$
\begin{align\*}
\max\_{w\_1, \ldots, w\_H} &u\_1(w\_1), \tag{1}\\
\text{ subject to } &\sum\_{i = 1}^H w\_i = W,\\
& u\_h(w\_h) \ge \overline{u}\_h, \forall h = 2,\ldots, H
\end{align\*}
$$
In some sense, this problem fixed the utility values of all but one individual at $\overline{u}\_h$. Then it looks for the allocation that maximizes the utility of the first individual. Any such solution should be Pareto optimal, as otherwise individual 1 should be able to get a higher utility. This is shown in the following theorem.

**Theorem** Assume the utility functions $u\_1(.), \ldots, u\_H(.)$ are strictly monotone and continuous. Then $(w\_1^\ast, \ldots, w\_H^\ast) \in F$ is Pareto optimal if and only if there exist values $(\overline{u}\_2,\ldots, \overline{u}\_H) \in \overline{U}$ such that $(w\_1^\ast, \ldots, w\_H^\ast)$ solves $(1)$.

*Proof:* Let $(w\_1^\ast, \ldots, w\_H^\ast) \in F$ be Pareto optimal. Define $\overline{u}\_h = u\_h(w\_h^\ast)$ for all $h = 2,\ldots, H$. We have that $(\overline{u}\_2,\ldots, \overline{u}\_H) \in \overline{U}$. Then if $(w\_1^\ast, \ldots, w\_H^\ast)$ does not solve $(1)$, there must be an allocation $(w\_1, \ldots, w\_H) \in F$ such that for $h \in \{2,\ldots, H\}$:
$$
u\_h(w\_h) \ge \overline{u}\_h = u\_h(w\_h^\ast)
$$
and:
$$
u\_1(w\_1) > u\_1(w\_1^\ast).
$$
However, this implies that $(w\_1, \ldots, w\_H)$ Pareto dominates the allocation $(w\_1^\ast, \ldots, w\_H^\ast)$, a contradiction.

For the reverse, assume that $(w\_1^\ast,\ldots, w\_H^\ast) \in F$ solves $(1)$ and assume, towards a contradiction that there is an allocation $(w\_1, \ldots, w\_H) \in F$ that Pareto dominates $(w\_1^\ast, \ldots, w\_H^\ast)$. This gives that for all $h \in \{2,\ldots, H\}$:
$$
u\_h(w\_h) \ge u\_h(w^\ast\_h) \ge \overline{u}\_h,
$$
and
$$
u\_1(w\_1) \ge u\_1(w\_1^\ast),
$$
with at least one inequality strict. If the strict inequality is for agent $1$, then we see that $(w\_1, \ldots, w\_H)$ improves upon the solution $(w\_1^\ast, \ldots w\_H^\ast)$ for problem $(1)$ which is a contradiction. As such, assume that $u\_k(w\_k) > u\_h(w\_k^\ast) \ge \overline{u}\_k$ for some $k \ne 1$.

Given this, by strict monotonicity, there must be at least one good in $w\_k$ whose amount is strictly above the amount in $w\_k^\ast$. Let $j$ be this good and let $1\_j$ be the vector of all zeros except at position $j$.

Now take a $\varepsilon > 0$ small enough such that:
$$
u\_k(w\_k - \varepsilon 1\_j) \ge \overline{u}\_k,
$$
Such $\varepsilon> 0$ can be found as $u\_k$ is continuous. Then define $(\hat w\_1, \ldots, \hat w\_H) \in F$ such that $\hat w\_1 = w\_1 + \varepsilon 1\_j$, $\hat w\_k = w\_k - \varepsilon 1\_j$ and $\hat w\_h = w\_h$ for all $h \in \{2,\ldots, H\} \setminus \{k\}$. Then we have that for all $h \in \{2,\ldots H\}$:
$$
u\_h(\hat w\_h) \ge \overline{u}\_h,
$$
and,
$$
u\_1(\hat w\_1) > u\_1(w\_1) \ge u\_1(w\_1^\ast)
$$
this means that $(\hat w\_1,\ldots, \hat w\_H)$ provides a better solution to $(1)$ compared to $(w\_1^\ast, \ldots, w\_H^\ast)$ which contradicts optimality of the latter. $\square$

> Because of concavity, the optimum for (4.1) maximizes the Lagrangean." I don't see what concavity has to do with this or why it is that the optimum for (4.1) also maximizes the Lagrangean.

The Langrangian first order conditions are sufficient if the objective function is concave and the constraints produce a convex set. This is true if the utility functions are concave. If you don't know how to get from an optimization problem to the Lagrangian (and vice versa), there are many resources online.

> In the previous step, the indexing of the constraint terms with the lagrange multipliers started at 2, not 1. And how are we showing that the Pareto optimum solves this maximization problem? I don't see how this follows from the previous step.

Consider the Lagrangian corresponding to $(1)$:
$$
(w\_1^\ast, \ldots, w\_H^\ast) \in \arg\max\_{w\_1, \ldots, w\_H} u\_1(w\_1) + \sum\_{i = 2}^H \lambda^i [u\_i(w\_i) - \overline{u}\_h] + \mu\left[ \sum\_{i = 1}^H w\_i - W\right]
$$
Here I explicitly added the constraint set to the problem. In your case, it is already substituted for into the utility function of the first individual.

Now, let us define $\lambda\_1 = 1$. Then we can rewrite the Lagrangian optimisation problem as:
$$
(w\_1^\ast, \ldots, w\_H^\ast) \in \arg\max\_{w\_1, \ldots, w\_H} \sum\_{i = 1}^H \lambda\_i u\_i(w\_i) + \mu \left[\sum\_{i = 1}^H w\_i - W\right] - \sum\_{i = 2}^H \lambda\_i \overline{u}\_h.
$$
The last sum is a constant term. So deleting it from this problem does not change the optimal solution. This gives:
$$
(w\_1^\ast, \ldots, w\_H^\ast) \in \arg\max\_{w\_1, \ldots w\_H} \sum\_{i = 1}^H \lambda\_i u\_i(w\_i) + \mu\left[\sum\_{i = 1}^H w\_i - W\right].
$$
Now, fixing the values $(\lambda\_1,\ldots, \lambda\_H)$, this is the Lagrangian corresponding to the following optimization problem:
$$
\begin{align\*}
\max\_{w\_1,\ldots, w\_H} &\sum\_{i = 1}^H \lambda\_i u\_i(w\_i),\\
\text{ subject to: } & \sum\_{i = 1}^H w\_i = W.
\end{align\*}
$$
This problem maximises a weighted sum of utilities subject to the resource constraint. This is in fact a more general result. If all utility functions are continuous strictly monotonic and concave then every Pareto efficient allocation results from the maximisation of some weighted sum of the utilities of all the individuals in the economy. The proof of this relies on a supporting hyperplane argument.


---

