Proof of fungibility theorem
Appendix to: A fungibility theorem
Suppose that is a set and we have functions
. Recall that for
, we say that
is a Pareto improvement over
if for all
, we have
. And we say that it is a strong Pareto improvement if in addition there is some
for which
. We call
a Pareto optimum if there is no strong Pareto improvement over it.
Theorem. Let be a set and suppose
for
are functions satisfying the following property: For any
and any
, there exists an
such that for all
, we have
.
Then if an element of
is a Pareto optimum, then there exist nonnegative constants
such that the function
achieves a maximum at
.
= 783df68a0f980790206b9ea87794c5b6)
Subscribe to RSS Feed
= f037147d6e6c911a85753b9abdedda8d)