Pareto efficiency

Pareto efficiency, or Pareto optimality, is an important notion in neoclassical economics with broad applications in game theory, engineering and the social sciences. Given a set of alternative allocations and a set of individuals, a movement from one allocation to another that can make at least one individual better off, without making any other individual worse off, is called a Pareto improvement or Pareto optimization. An allocation of resources is Pareto efficient or Pareto optimal when no further Pareto improvements can be made.

A strongly Pareto optimal (SPO) allocation (X) is one for which there cannot be any other feasible allocation (say X') such that the allocation (X') is strictly preferred by at least one person, and weakly preferred (not opposed) by everyone else. A (weakly) Pareto optimal (WPO) allocation is one where there is no feasible reallocation that would be strictly preferred by all agents.

The term is named after Vilfredo Pareto, an Italian economist who used the concept in his studies of economic efficiency and income distribution.

Pareto Frontier

For a given system, the Pareto Frontier or Pareto set is the set of parameterizations (allocations) that are all Pareto efficient. Finding Pareto Frontiers is particularly useful in engineering. By yielding all of the potentially optimal solutions, a designer can make focused tradeoffs within this constrained set of parameters, rather than needing to consider the full ranges of parameters.

The Pareto Frontier, P(Y), may be more formally described as follows. Consider a system with function $f:\mathbb {R} ^{n}\rightarrow \mathbb {R} ^{m}$ , where X is a compact set of feasible decisions in the metric space $\mathbb {R} ^{n}$ , and Y is the feasible set of criterion vectors in $\mathbb {R} ^{m}$ , such that $Y=\{y\in \mathbb {R} ^{m}:\;y=f(x),x\in X\;\}$ .

We assume that the preferred directions of criteria values are known. A point $y^{\prime \prime }\in \mathbb {R} ^{m}\;$ is preferred to (strictly dominating) another point $y^{\prime }\in \mathbb {R} ^{m}\;$ , written as $y^{\prime \prime }\vdash y^{\prime }$ . The Pareto Frontier is thus written as:

$P(Y)=\{y^{\prime }\in Y:\;\{y^{\prime \prime }\in Y:\;y^{\prime \prime }\vdash y^{\prime },y^{\prime \prime }\neq y^{\prime }\;\}=\emptyset \}$ .

Pareto efficiency in economics

If an economic system is Pareto efficient, then it is the case that no individual can be made better off without another being made worse off. It is commonly accepted that outcomes that are not Pareto efficient are to be avoided, and therefore Pareto efficiency is an important criterion for evaluating economic systems and political policies.

If economic allocation in any system (in the real world or in a model) is not Pareto efficient, there is theoretical potential for a Pareto improvement - an increase in Pareto efficiency: through reallocation, improvements to at least one participant's well-being can be made without reducing any other participant's well-being. In the real world ensuring that nobody is disadvantaged by a change aimed at improving economic efficiency may require compensation of one or more parties. For instance, if a change in economic policy dictates that a legally protected monopoly ceases to exist and that market subsequently becomes competitive and more efficient, the monopolist will be made worse off. However, the loss to the monopolist will be more than offset by the gain in efficiency. This means the monopolist can be compensated for its loss whilst still leaving an efficiency gain to be realised by others in the economy. Thus, the requirement of nobody being made worse off for a gain to others is met.

In particular, it can be shown that, under certain idealised conditions, a system of free markets will lead to a Pareto efficient outcome. This was first demonstrated mathematically by economists Kenneth Arrow and Gerard Debreu, although the result may not actually reflect the workings of real economies because of the restrictive assumptions necessary for the proof (markets exist for all possible goods, markets are perfectly competitive, and transaction costs are negligible). This is called the first welfare theorem.

A key drawback of Pareto optimality is its localisation and partial ordering. In an economic system with millions of variables there can be very many local optimum points. The Pareto improvement criterion does not define any global optimum. Given a reasonable criterion which compares all points, many Pareto-optimal solutions may be far inferior to the global best solution.

Criticisms

Pareto efficiency is a weak condition which does not require a "just" or equitable distribution of wealth. An economy in which the wealthy hold the vast majority of resources can be Pareto efficient.

This should, of course, not be understood as criticism of Pareto efficiency itself, but rather of the idea that Pareto efficiency is desirable or even only Pareto efficiency is desirable.

Amartya Sen has elaborated the mathematical reasons for this criticism, pointing out that under relatively plausible starting conditions, systems of social choice will converge on Pareto efficient, but inequitable, distributions. A simple example is dividing a pie into pieces to distribute among three people. The most equitable distribution is each person getting one third. However the solution of two people getting half a pie and the third person getting none is also Pareto optimal despite not being equitable, because the only way for the person with no piece to get a piece is for one or both of the other two to get less, which is not a Pareto improvement. A Pareto inefficient distribution of the pie might be each person getting one-quarter of the pie with the remainder discarded.

Of course, this example completely ignores the origin of the pie, so it breaks down to the criticism that Pareto efficiency does not really help in determining the optimal allocation of windfalls that nobody involved actually produced, such as land, inherited wealth, broadcast spectrum, the environment, or a pie miraculously falling from the sky.

A more generalized form of this criticism lies in the definition of Pareto efficiency itself. By requiring that no participants be worse off, Pareto efficiency protects the status quo and therefore any inequity or other problems currently existing.

References

Fudenberg, D. and Tirole, J. (1983). Game Theory. MIT Press. pp. Chapter 1, Section 2.4.{{cite book}}: CS1 maint: multiple names: authors list (link)
Osborne, M.J. and Rubenstein, A. (1994). A Course in Game Theory. MIT Press. pp. p. 7. ISBN 0-262-65040-1. {{cite book}}: |pages= has extra text (help)CS1 maint: multiple names: authors list (link)

v t e Topics of game theory
Definitions	Congestion game Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game Mechanism design
Equilibrium concepts	Bayes correlated equilibrium Bayesian Nash equilibrium Berge equilibrium Core Correlated equilibrium Coalition-proof Nash equilibrium Epsilon-equilibrium Evolutionarily stable strategy Gibbs equilibrium Mertens-stable equilibrium Markov perfect equilibrium Nash equilibrium Pareto efficiency Perfect Bayesian equilibrium Proper equilibrium Quantal response equilibrium Quasi-perfect equilibrium Risk dominance Satisfaction equilibrium Self-confirming equilibrium Sequential equilibrium Shapley value Strong Nash equilibrium Subgame perfection Trembling hand equilibrium
Strategies	Appeasement Backward induction Bid shading Collusion Cheap talk De-escalation Deterrence Escalation Forward induction Grim trigger Markov strategy Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat
Classes of games	Auction Bargaining problem Global game Intransitive game Mean-field game n-player game Perfect information Large Poisson game Potential game Repeated game Screening game Signaling game Strictly determined game Stochastic game Symmetric game Zero-sum game
Games	Go Chess Infinite chess Checkers All-pay auction Prisoner's dilemma Gift-exchange game Optional prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Lewis signaling game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Bertrand competition Cournot competition Stackelberg competition Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Induction puzzles Trust game Princess and monster game Rendezvous problem
Theorems	Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Negamax theorem Purification theorem Revelation principle Sprague–Grundy theorem Zermelo's theorem
Key figures	Albert W. Tucker Amos Tversky Antoine Augustin Cournot Ariel Rubinstein Claude Shannon Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin John Conway Jean Tirole Jean-François Mertens Jennifer Tour Chayes John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Olga Bondareva Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Axelrod Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Suzanne Scotchmer Thomas Schelling William Vickrey
Miscellaneous	Alpha–beta pruning Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory Glossary of game theory List of game theorists List of games in game theory No-win situation Topological game Tragedy of the commons

Pareto Frontier

Pareto efficiency in economics

Criticisms

See also

References