GROUP DECISION MAKING

Similar documents
7 INDIVIDUAL AND GROUP DECISION MAKING

Volume 31, Issue 1. Manipulation of the Borda rule by introduction of a similar candidate. Jérôme Serais CREM UMR 6211 University of Caen

Survey of Voting Procedures and Paradoxes

Strategy-Proofness on the Condorcet Domain

6.207/14.15: Networks Lecture 24: Decisions in Groups

3.1 Arrow s Theorem. We study now the general case in which the society has to choose among a number of alternatives

Social Choice Theory. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS Advanced Microeconomics II

Probabilistic Aspects of Voting

Social Choice. Jan-Michael van Linthoudt

Arrow s Paradox. Prerna Nadathur. January 1, 2010

Cosine similarity and the Borda rule

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation

Dependence and Independence in Social Choice Theory

Non compensatory Multicriteria Methods

On the Chacteristic Numbers of Voting Games

Voting. José M Vidal. September 29, Abstract. The problems with voting.

Political Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models

Who wins the election? Polarizing outranking relations with large performance differences. Condorcet s Approach. Condorcet s method

14.770: Introduction to Political Economy Lectures 1 and 2: Collective Choice and Voting

Finite Dictatorships and Infinite Democracies

Single-peaked consistency and its complexity

arxiv: v2 [math.co] 14 Apr 2011

APPLIED MECHANISM DESIGN FOR SOCIAL GOOD

Follow links for Class Use and other Permissions. For more information send to:

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive}

Lecture: Aggregation of General Biased Signals

Non-Manipulable Domains for the Borda Count

The Best Way to Choose a Winner

Condorcet Efficiency: A Preference for Indifference

MATH 19-02: HW 5 TUFTS UNIVERSITY DEPARTMENT OF MATHEMATICS SPRING 2018

Social choice theory, Arrow s impossibility theorem and majority judgment

Points-based rules respecting a pairwise-change-symmetric ordering

Dr. Y. İlker TOPCU. Dr. Özgür KABAK web.itu.edu.tr/kabak/

Chapter 12: Social Choice Theory

CMU Social choice 2: Manipulation. Teacher: Ariel Procaccia

THREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116

Recap Social Choice Fun Game Voting Paradoxes Properties. Social Choice. Lecture 11. Social Choice Lecture 11, Slide 1

Algorithmic Game Theory Introduction to Mechanism Design

Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion

Using a hierarchical properties ranking with AHP for the ranking of electoral systems

Partial lecture notes THE PROBABILITY OF VIOLATING ARROW S CONDITIONS

Coalitional Structure of the Muller-Satterthwaite Theorem

Nontransitive Dice and Arrow s Theorem

Winning probabilities in a pairwise lottery system with three alternatives

Empirical Comparisons of Various Voting Methods in Bagging

Voting Handout. Election from the text, p. 47 (for use during class)

Strategic Manipulability without Resoluteness or Shared Beliefs: Gibbard-Satterthwaite Generalized

"Arrow s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", by Phillip Reny. Economic Letters (70) (2001),

Lecture Notes, Lectures 22, 23, 24. Voter preferences: Majority votes A > B, B > C. Transitivity requires A > C but majority votes C > A.

INTEGER PROGRAMMING AND ARROVIAN SOCIAL WELFARE FUNCTIONS

Coalitionally strategyproof functions depend only on the most-preferred alternatives.

DOCUMENT DE TRAVAIL Centre de recherche sur l aide à l évaluation et à la décision dans les organisations (CRAEDO)

CONNECTING PAIRWISE AND POSITIONAL ELECTION OUTCOMES

Condorcet Consistency and the strong no show paradoxes

Thema Working Paper n Université de Cergy Pontoise, France

Economic Core, Fair Allocations, and Social Choice Theory

THE PROFILE STRUCTURE FOR LUCE S CHOICE AXIOM

UNIFYING VOTING THEORY FROM NAKAMURA S TO GREENBERG S THEOREMS

A NEW WAY TO ANALYZE PAIRED COMPARISONS

A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM

On Social Choice Theory

Logic and Social Choice Theory

Acyclic and indifference-transitive collective choice functions.

The Axiomatic Method in Social Choice Theory:

Arrow s General (Im)Possibility Theorem

On the probabilistic modeling of consistency for iterated positional election procedures

Antipodality in committee selection. Abstract

Introduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2)

Inequality of Representation

On the meaning of the Nash product. Walter Trockel

Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners 1

Fair Divsion in Theory and Practice

The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders

On the Strategy-proof Social Choice of Fixed-sized Subsets

The Arrow Impossibility Theorem Of Social Choice Theory In An Infinite Society And Limited Principle Of Omniscience

APPLIED MECHANISM DESIGN FOR SOCIAL GOOD

A Borda Count for Collective Sentiment Analysis

Combining Voting Rules Together

Computing with voting trees

REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING

A Failure of Representative Democracy

Binary Aggregation with Integrity Constraints

Voting Paradoxes Caused by Dropping Candidates in an Election

Social Dichotomy Functions (extended abstract)

Social Welfare Functions that Satisfy Pareto, Anonymity, and Neutrality: Countable Many Alternatives. Donald E. Campbell College of William and Mary

From Sentiment Analysis to Preference Aggregation

Chapter 1. The Mathematics of Voting

A generalization of Condorcet s Jury Theorem to weighted voting games with many small voters

SYSU Lectures on the Theory of Aggregation Lecture 2: Binary Aggregation with Integrity Constraints

arxiv: v1 [cs.si] 20 Oct 2014

Arrow s Impossibility Theorem: Preference Diversity in a Single-Profile World

Chapter 1 - Preference and choice

Antonio Quesada Universidad de Murcia. Abstract

Positively responsive collective choice rules and majority rule: a generalization of May s theorem to many alternatives

Efficiency and converse reduction-consistency in collective choice. Abstract. Department of Applied Mathematics, National Dong Hwa University

On the topological equivalence of the Arrow impossibility theorem and Amartya Sen s liberal paradox

Logic and Social Choice Theory. A Survey. ILLC, University of Amsterdam. November 16, staff.science.uva.

A Systematic Approach to the Construction of Non-empty Choice Sets

Judgement Aggregation

Voting and Mechanism Design

Transcription:

1 GROUP DECISION MAKING How to join the preferences of individuals into the choice of the whole society Main subject of interest: elections = pillar of democracy Examples of voting methods Consider n alternatives, from which one winning alternative shall be chosen. Simple majority Each voter chooses his most preferred alternative the alternative with the greatest number of votes wins Ostrakismos (Klesthenes, 508 př.kr.) Assemblage: each citizen wrote on an ostrakon the name of the person who is, according to his opinion, dangerous for the freedom of citizens the person against whom the majority of votes was, had to leave Athens for 10 years (did not lose his citizen rights nor his property)

2 Ramon Llull (1235 1316) The winner should also win in a duel with any of the remaining candidates. Blanquerna (1282 1287), Artifitium electiones pesonarum, (před 1283), De arte electionis (1299) Nicolaus Cusanus (1401 1464) Llul winner does not necessarily exist. Cusanus method, 1433: each voter gives 1 point to his least preferred candidate, 2 points to the one before the last,..., n points to his most preferred candidate. The winner is the candidate with the highest score. De concordantia catholica, 1433

3 Marie Jean Antoine Nicolas Caritat, marquis de Condorcet (1743 1794) Essai sur l application de l analyse à la probabilité des decisions rendues à la pluralité des voix, 1785 Voting method: each voter strictly orders all alternatives according to his preferences Condorcet winner : such an alternative X that for any other alternative Y, the number of voters preferring X to Y is greater than the number of voters preferring Y to X. Example. The majority preferrs C to B, C to A, B to A. B, C win against A; majority prefers C to B, the winner is C. Condorcet winner does not necessarily exist

4 Example. Consider three different voters with the following preferences: Voter X Y Z 1. A C B Preferences ranking 2. B A C Cycle: A B, B C, C A 3. C B A = it is always possible to find such an alternative that is able to beat the previous winner out on the basis of majority criterion (in a binary competition).

5 Condorcet paradox: Although all individual preferences are transitive, social preferences obtained by majority elections are not necessarily transitive. In democracy, in general, no best preference exists that could be possible to consider as a final, winning and the most equitable.

6 Jean Charles de Borda (1733 1799) Mémoire sur les élections au scrutin, 1781 (1770) Critique of election methods in Paris Academy: the winner of a majority election can be the generally least preferred candidate. Example: 12 voters with the following preferences choose one of three candidates, A, B, C. Number of voters 5 4 3 1. Alice Barbara Cecil Pořadí preferencí 2. Cecil Cecil Barbara 3. Barbara Alice Alice Majority method: Alice Barbara Cecil (5 : 4 : 3) Discord: decision between Alice and Cecil: Cecil Alice (7 : 5)

7 Borda method: Each alternative obtains from each voter the number of points according to its position at his preference ordering: if it is at the last place, it gains 1 point, at the one before last, 2 points,..., at the first place n points, where n is the number of alternatives. The winner is the alternative with the highest score. Used in Paris Academy: 1796 1803 The winner is not necessarily at the first place for any of voters; no cycles only draws

8 Score: Number of voters 5 4 3 1. Alice Barbara Cecil Preference ranking 2. Cecil Cecil Barbara 3. Barbara Alice Alice Alice... 3 5 + 1 4 + 1 3 = 22 Barbara... 1 5 + 3 4 + 2 3 = 23 Cecil... 2 5 + 2 4 + 3 3 = 27... Borda winner Pairwise decision: Barbara Alice (7 : 5) Cecil Barbara (8 : 4) Cecil Alice (7 : 5) candidates Cecil wins in the comparison with the remaining

9 Charles Lutwidge Dodgson (1832 1898) A Method of Taking Votes on More than Two Issues, 1876 A voting system inspired by Condorcet: the winner is the candidate who is closest to the Condorcet winner: he would became Condorcet winner by the lowest number of changes in preferences of voters Duncan Black (1908 1991) On the Rationale of Group Decision Making, 1948 Theory of Committees and Elections, 1958 Propagated the works of Charles Dodgson Black method: Condorcet winner, if he exists the winner = Borda winner otherwise

10 Kenneth Arrow (*1921) Social Choice and Individual Values, 1951 A = {x, y,..., z} set of alternatives Q = {1, 2,..., n} set of individuals, society For each individual i Q and any alternatives x and y, a complete ordering (i prefers x to y or is indifferent between x, y) is defined: x i y iff it is not y i x (i prefers x to y), x i y iff x i y y i x (i is indiff. between x, y). Further, relations preference i and indifference i are defined: x i y iff it is not y i x (i prefers x to y), x i y iff x i y y i x (i is indiff. between x, y).

Schematic representation of preferences: for example: R 1 R 2 R 3 x y x y y x Denote the set of all orderings of alternatives R = {R 1, R 2,..., R m } Definition. By a profile of preference orderings for the individuals of the society we mean an n-tuple of orderings, (R 1,..., R n ), where R i is the preference ordering for the ith individual. 11

12 Definition. By a social welfare function we mean a rule which associates to each profile of preference orderings a preference ordering for the society itself, i.e. F : R n R; (R 1, R 2,..., R n ) R; we will write simply x y instead of (x, y) R (society prefers x to y or is indifferent between x, y); analogically for x y, x y.

13 Condition 1 The social welfare function F is defined for all possible profiles of individual orderings. The number of alternatives in A is greater than or equal to three, i.e. A 3. There are at least two individuals, i.e. Q 2. Remark: Does not hold e.g. for Condorcet method

14 Condition 2 (positive association of social and individual values). If the welfare function asserts that x is preferred to y for a given profile of individual preferences, it shall assert the same when the profile is modified as follows: The individual paired comparisons between alternatives other than x are not changed Each individual paired comparison between x and any other alternative either remains unchanged or it is modified in x s favor.

15 Remark: Consider the following preference profiles. If F is such, that for a profile R 1 R 2 R 3 x x z x y z y y z it is y z, then it would contradict the intuition if for a profile it would not remain y z : R 1 R 2 R 3 x y x z y z y x z

16 Condition 3 (independence of irrelevant alternatives). Let B be any subset of alternatives in A. If a profile of orderings is modified in such a manner that each individual s paired comparisons among the alternatives of B are left invariant, the social orderings resulting from the original and modified profiles of individual orderings should be identical for the alternatives in B.

17 Remark: Condition 3 does not hold for a Borda method: V W X Y Z 1. A A B B C 2. B C C C B 3. C B D D D 4. D D A A A Score: A... 11 D... 8 Preference of society: A D Restriction of the set of alternatives to {A, D} : V W X Y Z 1. A A D D D 2. D D A A A Počet bodů: A... 7 D... 8 Preference of society: D A

18 Condition 4 (citizen s sovereignity). For each pair of alternatives x and y there is some profile if individual orderings such that society prefers x to y. Condition 5 (non-dictatorship). There is no individual with the property that whenever he prefers x to y (for any x and y) society does likewise, regardless of the preferences of other individuals.

Condition 4 (citizen s sovereignity). For each pair of alternatives x and y there is some profile if individual orderings such that society prefers x to y. Condition 5 (non-dictatorship). There is no individual with the property that whenever he prefers x to y (for any x and y) society does likewise, regardless of the preferences of other individuals. Theorem (Arrow s Impossibility Theorem). The conditions 1, 2, 3, 4 and 5 are inconsistent. It means that there does not exist any welfare function which possesses the properties demanded by these conditions. In other words, if a welfare function satisfies conditions 1, 2 and 3, then it is either imposed or dictatorial. 19

20 Proof of Arrow s Impossibility Theorem 1. Suppose that V is a minimal decisive set, i.e. there exist alternatives x, y A, such that V is decisive for (x, y), but no proper subset V V is decisive for any ordered pair of alternatives. V exists: Q is decisive for any pair of alternatives (so-called Pareto optimality; follows from conditions 1 4). Individuals can be removed one at a time until the remaining set is no longer decisive for any pair. Then, if V =, then a pair (x, y) would exist, such that would be a decisive set; but in this case Q = Q \ would not be decisive for (x, y), which is a contradiction.

21 2. Choose an arbitrary j V ; denote W = V \{j}, U = Q\V (since Q 2, at least one of the sets U, W is non-empty). Choose an arbitrary z A, z x, y. Consider the following profile: {j} W U x z y y x z z y x For all i V = W {j} it is x i y, hence x y. It must be also y z (otherwise W would be decisive for (z, y), which is a contradiction with the minimality of V ). From transitivity we have: x z. But j is the only individual, who prefers x to z; since V is minimal, {j} can not be a proper subset of V, hence V = {j}.

22 3. By now, we have shown that for every z x, {j} is decisive for (x, z). Now consider any w A, w x, z. We will show that {j} is also decisive for (w, z) and (w, x). Consider the following profiles: {j} w x z {j} w z x U z w x U z x w From Pareto optimality, we have: w x; {j} is decisive for (x, z), hence x z; from transitivity: w z, tj. {j} is decisive for (w, z). {j} is decisive for (w, z), thus w z; from Pareto optimality: z x; from transitivity: w x, i.e. {j} is decisive for (w, x). We have therefore shown that {j} is decisive for any pair of alternatives thus it is a dictator from the condition 5.

23 Remark. Simple majority principle is the only one satisfying the following conditions: Decisiveness: For any profile of individual choices, it specifies a unique group decision for each paired comparison. Anonymity: It does not depend upon the labeling of individuals. Neutrality: It does not depend upon the labeling of the two alternatives. Positive responsiveness: If for a given profile the rule specifies that x y and if a single individual then changes his paired comparison in favor of x, while the remainder of the society maintain their former choices, then the rule requires that in the group decision it is x y. Denote N x = {i Q; x i y}, N y = {i Q; y i x}, N I = {i Q; x i y}.

24 Anonymity: group decision upon x, y depends only upon N x, N y, N I, from neutrality it follows: x y, iff N x = N y, by a repeated use of a positive responsiveness it is possible to show: x y if and only if N x > N y, resp. y x if and only if N y > N x.