Definition:Strong Pareto Efficiency

Definition

Let $N$ be a finite set.

Let $X \subseteq \R^N$ be a set.

This article, or a section of it, needs explaining. In particular: what does $\R^N$ mean in this context? This definition has been rendered verbatim from the source work and needs amplification. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by explaining it. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Explain}} from the code.

Then $x \in X$ is strongly Pareto efficient if and only if there exists no $y \in X$ for which $x_i \le y_i$ for all $i \in N$ and for which $x_i < y_i$ for at least one $i \in N$.

Source of Name

This entry was named for Vilfredo Federico Damaso Pareto.

Sources

• 1994: Martin J. Osborne and Ariel Rubinstein: A Course in Game Theory ... (previous) ... (next): $1.7$: Terminology and Notation