<p>Acyclicality as defined by Eliaz is simply the condition that
the values of a social aggregator are transitive. It is different from the usual acyclicity condition according to which a relation is acyclic iff it has irreflexive transitive closure. The formulation of Eliaz is a bit cryptic, but he actually shows in his Observation 1 that his acyclicality implies transitivity. The converse is also easy; the simple details are below. The result of the Pareto extension rule need of course not be transitive.</p>
<p>Formally, acyclicality as defined by Eliaz says that for all <span class="math-container">$R\in\mathbf{R}$</span> and for every three alternatives <span class="math-container">$a$</span>, <span class="math-container">$b$</span> and <span class="math-container">$c$</span> in <span class="math-container">$A$</span>, if <span class="math-container">$aRb$</span> and <span class="math-container">$\neg(cRb)$</span>, then <span class="math-container">$\neg(cRa)$</span>.</p>
<p>But the condition that for every three alternatives <span class="math-container">$a$</span>, <span class="math-container">$b$</span> and <span class="math-container">$c$</span> in <span class="math-container">$A$</span>, if <span class="math-container">$aRb$</span> and <span class="math-container">$\neg(cRb)$</span>, then <span class="math-container">$\neg(cRa)$</span> is simply the transitivity of <span class="math-container">$R$</span>, formulated in a slightly weird but equivalent way.</p>
<p>Here is the simple proof: Assume that <span class="math-container">$R$</span> is transitive and <span class="math-container">$aRb$</span> and <span class="math-container">$\neg(cRb)$</span>. If it were the case that <span class="math-container">$cRa$</span>, then <span class="math-container">$cRb$</span> by transitivity, contradicting the assumption. For the other direction, assume that the condition holds and that <span class="math-container">$cRa$</span> and <span class="math-container">$cRb$</span> holds. We want to show that <span class="math-container">$cRb$</span>. Indeed, if not then by the condition <span class="math-container">$\neg(cRa)$</span>, contradicting the assumption.</p>

CC BY-SA 4.0
2020-09-05T23:37:02.550Z
2020-09-07T13:51:36.643Z
2020-09-07T13:51:36.643Z
Michael Greinecker
<p><a href="https://link.springer.com/article/10.1007/s00355-003-0291-1" rel="nofollow noreferrer">Eliaz (2004)</a> uses social aggregators to provide a unique &quot;meta-theorem&quot; from which Arrow and Gibbard-Satterthwaite follow as corollaries. He defines social aggregators as follows. Let <span class="math-container">$\mathcal{P}$</span> denote the set of all n-tuples of linear (thus strict) orderings over the elements of set <span class="math-container">$X$</span>, where <span class="math-container">$|X| \geq 3$</span>, and <span class="math-container">$\mathbf{R}$</span> a set of binary relations on <span class="math-container">$X$</span>. A social aggregator is a function <span class="math-container">$F: \mathcal{P} \rightarrow \mathbf{R}$</span>. A social welfare function is a social aggregator satisfying acyclicality, completeness, and existence of a best alternative; a social choice function takes more work to define, but in short, completeness is only required for at least one alternative which is socially ranked at least as high as all others.</p>
<p>Eliaz then proves that <em>no non-dictatorial social aggregator can satisfy acyclicality, existence of a best alternative, weak Pareto efficiency, and &quot;preference reversal&quot;</em>, which is basically an independence requirement by which a reversal of the social relation must follow the same reversal in the preferences of an individual. He then shows that from the conditions above follow all the conditions in Arrow and Gibbard-Satterthwaite, which are thus just special cases of the general meta-theorem.</p>
<p>I have two key questions:</p>
<ol>
<li><p>To be a social welfare function à la Arrow, do we not require more than just acyclicality - in particular, transitivity? Is it correct that what Eliaz calls a social welfare function, is actually a social decision function?</p>
</li>
<li><p>If so, isn't Sen's (1969) Pareto-extension rule a counter-example to the meta-theorem? For strict individual orderings, the Pareto-extension rule works as follows: all conflicting profiles (i.e. all those profiles in which there are two <span class="math-container">$x,y \in X$</span> and two <span class="math-container">$i,j \in N$</span>, <span class="math-container">$N$</span> being the set of individuals, such that <span class="math-container">$xP_i y$</span> and <span class="math-container">$yP_j x$</span>), then <span class="math-container">$xRy$</span> and <span class="math-container">$yRx$</span>, <span class="math-container">$R$</span> being the social relation. In other words, the Pareto-extension rule resolves all conflicts by ties. This rule should satisfy all condition imposed by Eliaz: acyclicality (it is actually quasi-transitive, a stronger condition), existence of a best alternative, non-dictatorship, independence (subsumed by preference reversal), and clearly, weak Pareto efficiency.</p>
</li>
</ol>

<microeconomics><social-choice><choice-theory>
Doesn't the Pareto-extension rule invalidate Eliaz's (2004) unified theorem of social choice?
decisionsdecisions
# Doesn't the Pareto-extension rule invalidate Eliaz's (2004) unified theorem of social choice?

(Asked by: username_0 on 2020-09-05)

[Eliaz (2004)](https://link.springer.com/article/10.1007/s00355-003-0291-1) uses social aggregators to provide a unique "meta-theorem" from which Arrow and Gibbard-Satterthwaite follow as corollaries. He defines social aggregators as follows. Let $\mathcal{P}$ denote the set of all n-tuples of linear (thus strict) orderings over the elements of set $X$, where $|X| \geq 3$, and $\mathbf{R}$ a set of binary relations on $X$. A social aggregator is a function $F: \mathcal{P} \rightarrow \mathbf{R}$. A social welfare function is a social aggregator satisfying acyclicality, completeness, and existence of a best alternative; a social choice function takes more work to define, but in short, completeness is only required for at least one alternative which is socially ranked at least as high as all others.

Eliaz then proves that *no non-dictatorial social aggregator can satisfy acyclicality, existence of a best alternative, weak Pareto efficiency, and "preference reversal"*, which is basically an independence requirement by which a reversal of the social relation must follow the same reversal in the preferences of an individual. He then shows that from the conditions above follow all the conditions in Arrow and Gibbard-Satterthwaite, which are thus just special cases of the general meta-theorem.

I have two key questions:

1. To be a social welfare function à la Arrow, do we not require more than just acyclicality - in particular, transitivity? Is it correct that what Eliaz calls a social welfare function, is actually a social decision function?
2. If so, isn't Sen's (1969) Pareto-extension rule a counter-example to the meta-theorem? For strict individual orderings, the Pareto-extension rule works as follows: all conflicting profiles (i.e. all those profiles in which there are two $x,y \in X$ and two $i,j \in N$, $N$ being the set of individuals, such that $xP\_i y$ and $yP\_j x$), then $xRy$ and $yRx$, $R$ being the social relation. In other words, the Pareto-extension rule resolves all conflicts by ties. This rule should satisfy all condition imposed by Eliaz: acyclicality (it is actually quasi-transitive, a stronger condition), existence of a best alternative, non-dictatorship, independence (subsumed by preference reversal), and clearly, weak Pareto efficiency.

**Tags:** microeconomics, social-choice, choice-theory

---

## 1 answers

### Answer by username_1 on 2020-09-05. Score: 2

Acyclicality as defined by Eliaz is simply the condition that
the values of a social aggregator are transitive. It is different from the usual acyclicity condition according to which a relation is acyclic iff it has irreflexive transitive closure. The formulation of Eliaz is a bit cryptic, but he actually shows in his Observation 1 that his acyclicality implies transitivity. The converse is also easy; the simple details are below. The result of the Pareto extension rule need of course not be transitive.

Formally, acyclicality as defined by Eliaz says that for all $R\in\mathbf{R}$ and for every three alternatives $a$, $b$ and $c$ in $A$, if $aRb$ and $\neg(cRb)$, then $\neg(cRa)$.

But the condition that for every three alternatives $a$, $b$ and $c$ in $A$, if $aRb$ and $\neg(cRb)$, then $\neg(cRa)$ is simply the transitivity of $R$, formulated in a slightly weird but equivalent way.

Here is the simple proof: Assume that $R$ is transitive and $aRb$ and $\neg(cRb)$. If it were the case that $cRa$, then $cRb$ by transitivity, contradicting the assumption. For the other direction, assume that the condition holds and that $cRa$ and $cRb$ holds. We want to show that $cRb$. Indeed, if not then by the condition $\neg(cRa)$, contradicting the assumption.


---

