33  Social Welfare Functions

So far, we have focused on voting methods that select winners from a set of candidates. However, in many situations, we want not just to identify winners, but to create a complete ranking of all alternatives. A Social Welfare Function provides such a ranking.

Definition 33.1 (Social Welfare Function) A Social Welfare Function \(f\) maps each profile \(\mathbf{P}\) from some domain \(\mathcal{D}\) to an ordering of the candidates. For each pair of candidates \(x\) and \(y\), this ordering specifies whether \(x\) is ranked above \(y\), \(y\) is ranked above \(x\), or \(x\) and \(y\) are tied.

Formally, for any profile \(\mathbf{P}\), the social ordering \(f(\mathbf{P})\) is a relation on the set of candidates where:

  • \(x\) is ranked above \(y\) according to \(f\) in \(\mathbf{P}\) if \((x,y)\in f(\mathbf{P})\) and \((y,x)\notin f(\mathbf{P})\)
  • \(x\) is tied with \(y\) according to \(f\) in \(\mathbf{P}\) if \((x,y)\in f(\mathbf{P})\) and \((y,x)\in f(\mathbf{P})\)

Key properties of Social Welfare Functions:

The following are some examples of Social Welfare Functions:

These methods can produce different rankings of the same profile. Consider the following example profile with 100 voters and three candidates (\(t\), \(r\), and \(k\)):

\[\begin{array}{ccc} 40 & 35 & 25 \\\hline t & r & k\\ k & k & r\\ r & t & t \end{array}\]

The different methods introduced above produce the following rankings:

This example illustrates how different Social Welfare Functions can disagree about the proper ranking of a set of candidates, even with the same underlying voter preferences.

The next chapter explores properties of Social Welfare Functions and discusses one of the most important results in social choice theory: Arrow’s impossibility theorem. This theorem shows that no Social Welfare Function can satisfy certain basic and seemingly reasonable properties simultaneously.