Unrestricted domain

Last updated

In social choice theory, unrestricted domain, or universality, is a property of social welfare functions in which all preferences of all voters (but no other considerations) are allowed. Intuitively, unrestricted domain is a common requirement for social choice functions, and is a condition for Arrow's impossibility theorem.

Contents

With unrestricted domain, the social welfare function accounts for all preferences among all voters to yield a unique and complete ranking of societal choices. Thus, the voting mechanism must account for all individual preferences, it must do so in a manner that results in a complete ranking of preferences for society, and it must deterministically provide the same ranking each time voters' preferences are presented the same way.

Relation to Arrow's impossibility theorem

Unrestricted domain is one of the conditions for Arrow's impossibility theorem. Under that theorem, it is impossible to have a social choice function that satisfies unrestricted domain, Pareto efficiency , independence of irrelevant alternatives , and non-dictatorship . However, the conditions of the theorem can be satisfied if unrestricted domain is removed.

Examples of restricted domains

Duncan Black defined a restriction to domains of social choice functions called "single-peaked preferences". Under this principle, all of the choices have a predetermined position along a line, giving them a linear ordering. Every voter has some special place he likes best along that line. His ordering of the choices is determined by their distances from that spot. For example, if voting on where to set the volume for music, it would be reasonable to assume that each voter had their own ideal volume preference and that as the volume got progressively too loud or too quiet they would be increasingly dissatisfied. Black proved that by replacing unrestricted domain with single-peaked preferences in Arrow's theorem removes the impossibility: there are Pareto-efficient non-dictatorships that satisfy the "independence of irrelevant alternatives" criterion. However, Black's 1948 proof was published before Arrow's impossibility theorem was published in 1950, and thus did not fully consider Arrow's "unrestricted domain" criterion.

Related Research Articles

<span class="mw-page-title-main">Arrow's impossibility theorem</span> Proof all ranked voting rules have spoilers

Arrow's impossibility theorem is a key result in social choice theory, showing that no ranking-based decision rule can satisfy the requirements of rational choice theory. Most notably, Arrow showed that no such rule can satisfy independence of irrelevant alternatives, the principle that a choice between two alternatives A and B should not depend on the quality of some third, unrelated option C.

<span class="mw-page-title-main">Social welfare function</span> Function that ranks states of society according to their desirability

In welfare economics and social choice theory, a social welfare function—also called a socialordering, ranking, utility, or choicefunction—is a function that ranks a set of social states by their desirability. Each person's preferences are combined in some way to determine which outcome is considered better by society as a whole. It can be seen as mathematically formalizing Rousseau's idea of a general will.

Independence of irrelevant alternatives (IIA) is a major axiom of decision theory which codifies the intuition that a choice between and should not depend on the quality of a third, unrelated outcome . There are several different variations of this axiom, which are generally equivalent under mild conditions. As a result of its importance, the axiom has been independently rediscovered in various forms across a wide variety of fields, including economics, cognitive science, social choice, fair division, rational choice, artificial intelligence, probability, and game theory. It is closely tied to many of the most important theorems in these fields, including Arrow's impossibility theorem, the Balinski-Young theorem, and the money pump arguments.

The Gibbard–Satterthwaite theorem is a theorem in voting theory. It was first conjectured by the philosopher Michael Dummett and the mathematician Robin Farquharson in 1961 and then proved independently by the philosopher Allan Gibbard in 1973 and economist Mark Satterthwaite in 1975. It deals with deterministic ordinal electoral systems that choose a single winner, and shows that for every voting rule of this form, at least one of the following three things must hold:

  1. The rule is dictatorial, i.e. there exists a distinguished voter who can choose the winner; or
  2. The rule limits the possible outcomes to two alternatives only; or
  3. The rule is not straightforward, i.e. there is no single always-best strategy.
<span class="mw-page-title-main">Random ballot</span> Electoral system with lottery among ballots

A random ballot or random dictatorship is a randomized electoral system where the election is decided on the basis of a single randomly-selected ballot. A closely-related variant is called random serialdictatorship, which repeats the procedure and draws another ballot if multiple candidates are tied on the first ballot.

<span class="mw-page-title-main">Welfare economics</span> Use of microeconomic techniques to evaluate well-being at the aggregate level

Welfare economics is a field of economics that applies microeconomic techniques to evaluate the overall well-being (welfare) of a society.

<span class="mw-page-title-main">May's theorem</span> Social choice theorem on superiority of majority voting

In social choice theory, May's theorem, also called the general possibility theorem, says that majority vote is the unique ranked social choice function between two candidates that satisfies the following criteria:

<span class="mw-page-title-main">Median voter theorem</span> Theorem in political science

The median voter theorem in political science and social choice theory, developed by Duncan Black, states that if voters and candidates are distributed along a one-dimensional spectrum and voters have single-peaked preferences, any voting method that is compatible with majority-rule will elect the candidate preferred by the median voter. The median voter theorem thus shows that under a realistic model of voter behavior, Arrow's theorem, which essentially suggests that ranked-choice voting systems cannot eliminate the spoiler effect, does not apply, and therefore that rational social choice is in fact possible if the election system is using a Condorcet method.

<span class="mw-page-title-main">Liberal paradox</span> Paradox in social choice

The liberal paradox, also Sen paradox or Sen's paradox, is a logical paradox proposed by Amartya Sen which shows that no means of aggregating individual preferences into a single, social choice, can simultaneously fulfill the following, seemingly mild conditions:

  1. The unrestrictedness condition, or U: every possible ranking of each individual's preferences and all outcomes of every possible voting rule will be considered equally,
  2. The Pareto condition, or P: if everybody individually likes some choice better at the same time, the society in its voting rule as a whole likes it better as well, and
  3. Liberalism, or L : all individuals in a society must have at least one possibility of choosing differently, so that the social choice under a given voting rule changes as well. That is, as an individual liberal, anyone can exert their freedom of choice at least in some decision with tangible results.
<span class="mw-page-title-main">Social choice theory</span> Academic discipline

Social choice theory is a branch of welfare economics that analyzes methods of combining individual opinions, beliefs, or preferences to reach a collective decision or create measures of social well-being. It contrasts with political science in that it is a normative field that studies how societies should make decisions, whereas political science is descriptive. Social choice incorporates insights from economics, mathematics, philosophy, political science, and game theory to find the best ways to combine individual preferences into a coherent whole, called a social welfare function.

<span class="mw-page-title-main">Positional voting</span> Class of ranked-choice electoral systems

Positional voting is a ranked voting electoral system in which the options or candidates receive points based on their rank position on each ballot and the one with the most points overall wins. The lower-ranked preference in any adjacent pair is generally of less value than the higher-ranked one. Although it may sometimes be weighted the same, it is never worth more. A valid progression of points or weightings may be chosen at will or it may form a mathematical sequence such as an arithmetic progression, a geometric one or a harmonic one. The set of weightings employed in an election heavily influences the rank ordering of the candidates. The steeper the initial decline in preference values with descending rank, the more polarised and less consensual the positional voting system becomes.

<span class="mw-page-title-main">Social Choice and Individual Values</span>

Kenneth Arrow's monograph Social Choice and Individual Values and a theorem within it created modern social choice theory, a rigorous melding of social ethics and voting theory with an economic flavor. Somewhat formally, the "social choice" in the title refers to Arrow's representation of how social values from the set of individual orderings would be implemented under the constitution. Less formally, each social choice corresponds to the feasible set of laws passed by a "vote" under the constitution even if not every individual voted in favor of all the laws.

<span class="mw-page-title-main">Kemeny–Young method</span> Single-winner electoral system

The Kemeny–Young method is an electoral system that uses ranked ballots and pairwise comparison counts to identify the most popular choices in an election. It is a Condorcet method because if there is a Condorcet winner, it will always be ranked as the most popular choice.

<span class="mw-page-title-main">Dictatorship mechanism</span> Theoretical rule in social choice theory

In social choice theory, a dictatorship mechanism is a degenerate voting rule or mechanism where the result depends on only one person's preferences, without considering any other voters. A serial dictatorship is similar, but also designates a series of "backup dictators", who break ties in the original dictator's choices when the dictator is indifferent.

There are a number of different criteria which can be used for voting systems in an election, including the following

<span class="mw-page-title-main">Arunava Sen</span> Indian researcher and teacher

Arunava Sen is a professor of economics at the Indian Statistical Institute. He works on Game Theory, Social Choice Theory, Mechanism Design, Voting and Auctions.

<span class="mw-page-title-main">Maximal lotteries</span> Probabilistic Condorcet method

Maximal lotteries refers to a probabilistic voting rule. The method uses preferential ballots and returns a probability distribution of candidates that a majority of voters would weakly prefer to any other.

<span class="mw-page-title-main">Black's method</span> Single-winner electoral system

Black's method is an election method proposed by Duncan Black in 1958 as a compromise between the Condorcet method and the Borda count. This method selects a Condorcet winner. If a Condorcet winner does not exist, then the candidate with the highest Borda score is selected.

<span class="mw-page-title-main">Highest median voting rules</span>

The highest median voting rules are a class of graded voting rules where the candidate with the highest median rating is elected.

The median voting rule or median mechanism is a rule for group decision-making along a one-dimensional domain. Each person votes by writing down his/her ideal value, and the rule selects a single value which is the median of all votes.

References