Pareto Optimality in Electoral Competition

1971 ◽  
Vol 65 (4) ◽  
pp. 1141-1145 ◽  
Author(s):  
Peter C. Ordeshook

The core of welfare economics consists of the proof that, for certain classes of goods, perfectly competitive markets are efficient in that they provide Pareto optimal allocations of these goods. In this paper, the efficiency of competitive elections is examined. Elections are modeled as two-candidate zero-sum games, and three kinds of equilibria for such games are identified: pure, risky, and mixed strategies. It is shown, however, that regardless of which kind of equilibrium prevails, if candidates adopt equilibrium strategies, an election is efficient in the sense that the candidates advocate Pareto optimal policies. But one caveat to this analysis is that while an election is Pareto optimal, citizens can unanimously prefer markets to elections as a mechanism for selecting future policies.

ORDO ◽  
2012 ◽  
Vol 63 (1) ◽  
Author(s):  
Michael Pickhardt

SummaryIn this paper I examine the relationship between Pareto-optimality and group size in linear public goods games or experiments. In particular, I use the standard setting of homogeneous linear public goods experiments and apply a recently developed tool to identify all Pareto-optimal allocations in such settings. It turns out that under any conceivable circumstances, ceteris paribus, small groups have a higher Pareto-ratio (Pareto-optimal allocations over total allocations) than large groups. Hence, if Pareto-optimality of an allocation is a property that makes such allocations acceptable and maintainable, small groups will find is easier to provide Pareto-optimal amounts of a public good than large groups. This is a novel reasoning for Mancur Olson′s claim, in particular, with respect to what he has termed inclusive goods and inclusive groups.


2008 ◽  
Vol 38 (1) ◽  
pp. 105-136 ◽  
Author(s):  
Pauline Barrieu ◽  
Giacomo Scandolo

In this paper, we consider the problem of Pareto optimal allocation in a general framework, involving preference functionals defined on a general real vector space. The optimization problem is equivalent to a modified sup-convolution of the different agents’ preference functionals. The results are then applied to a multi-period setting and some further characterization of Pareto optimality for an allocation is obtained for expected utility for processes.


2008 ◽  
Vol 38 (01) ◽  
pp. 105-136 ◽  
Author(s):  
Pauline Barrieu ◽  
Giacomo Scandolo

In this paper, we consider the problem of Pareto optimal allocation in a general framework, involving preference functionals defined on a general real vector space. The optimization problem is equivalent to a modified sup-convolution of the different agents’ preference functionals. The results are then applied to a multi-period setting and some further characterization of Pareto optimality for an allocation is obtained for expected utility for processes.


2019 ◽  
Vol 16 (1) ◽  
Author(s):  
Bertrand Crettez

Abstract The Coase theorem states that where there are externalities and no transaction costs resource allocation is Pareto-optimal and independent of the stakeholders’ legal position. This result has been challenged many times. In the cooperative game approach to resource allocation, the refutation is made by constructing a three-person game which has an empty core under one set of liability rules—which implies that optimal allocations are coalitionally unstable–and a nonempty core under another set. In this example, however, the probability that the core is non-empty is rather high (5/6). Yet, even if coalitionally stable Pareto-optimal arrangements are likely, to establish the plain validity of the Coase theorem it must be shown that the legal neutrality statement also holds. We show that for the three-person cooperative game example mentioned above, the probability that the two assertions of the Coase theorem hold can be as low as 3/8.


Sign in / Sign up

Export Citation Format

Share Document