Social Choice Rules and their Manipulability

Slides:



Advertisements
Similar presentations
Chapter 7 Hypothesis Testing
Advertisements

Fast Algorithms For Hierarchical Range Histogram Constructions
Common Voting Rules as Maximum Likelihood Estimators Vincent Conitzer (Joint work with Tuomas Sandholm) Early version of this work appeared in UAI-05.
Presented by: Katherine Goulde
Voting and social choice Vincent Conitzer
1 Public choice Alexander W. Cappelen Econ
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
How “impossible” is it to design a Voting rule? Angelina Vidali University of Athens.
Arrow’s impossibility theorem EC-CS reading group Kenneth Arrow Journal of Political Economy, 1950.
1 1 Slide STATISTICS FOR BUSINESS AND ECONOMICS Seventh Edition AndersonSweeneyWilliams Slides Prepared by John Loucks © 1999 ITP/South-Western College.
But, how?? Explaining all possible positional, pairwise voting paradoxes & prop. Don Saari Institute for Math Behavioral Sciences University of California,
Strategic Sequential Voting in Multi-Issue Domains and Multiple-Election Paradoxes Lirong Xia Joint work with Vincent ConitzerJerome Lang Sep 9, 2011.
Lecture Presentation Software to accompany Investment Analysis and Portfolio Management Seventh Edition by Frank K. Reilly & Keith C. Brown Chapter.
CPS Voting and social choice
Social Choice Theory By Shiyan Li. History The theory of social choice and voting has had a long history in the social sciences, dating back to early.
AN INTRODUCTION TO PORTFOLIO MANAGEMENT
Social Choice Theory By Shiyan Li. History The theory of social choice and voting has had a long history in the social sciences, dating back to early.
Common Voting Rules as Maximum Likelihood Estimators Vincent Conitzer and Tuomas Sandholm Carnegie Mellon University, Computer Science Department.
Chapter 6 An Introduction to Portfolio Management.
Part III: Inference Topic 6 Sampling and Sampling Distributions
Inferences About Process Quality
Strategic Behavior in Multi-Winner Elections A follow-up on previous work by Ariel Procaccia, Aviv Zohar and Jeffrey S. Rosenschein Reshef Meir The School.
Social choice (voting) Vincent Conitzer > > > >
Overview Aggregating preferences The Social Welfare function The Pareto Criterion The Compensation Principle.
Presented by Johanna Lind and Anna Schurba Facility Location Planning using the Analytic Hierarchy Process Specialisation Seminar „Facility Location Planning“
Statistics for Managers Using Microsoft Excel, 5e © 2008 Prentice-Hall, Inc.Chap 12-1 Statistics for Managers Using Microsoft® Excel 5th Edition Chapter.
Overview Definition Hypothesis
Introduction to Statistical Inferences
© 2012 Cengage Learning. All Rights Reserved. May not scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. Chapter.
Social threshold aggregations Fuad T. Aleskerov, Vyacheslav V. Chistyakov, Valery A. Kalyagin Higher School of Economics.
Version 1.2 Copyright © 2000 by Harcourt, Inc. All rights reserved. Requests for permission to make copies of any part of the work should be mailed to:
Portfolio Management-Learning Objective
Lecture Presentation Software to accompany Investment Analysis and Portfolio Management Seventh Edition by Frank K. Reilly & Keith C. Brown Chapter 7.
STOCHASTIC DOMINANCE APPROACH TO PORTFOLIO OPTIMIZATION Nesrin Alptekin Anadolu University, TURKEY.
Some Background Assumptions Markowitz Portfolio Theory
Investment Analysis and Portfolio Management Chapter 7.
CPS Voting and social choice Vincent Conitzer
Yaomin Jin Design of Experiments Morris Method.
Investment Analysis and Portfolio Management First Canadian Edition By Reilly, Brown, Hedges, Chang 6.
1 Elections and Manipulations: Ehud Friedgut, Gil Kalai, and Noam Nisan Hebrew University of Jerusalem and EF: U. of Toronto, GK: Yale University, NN:
Computing the Degree of the Manipulability in the Case of Multiple Choice Fuad Aleskerov (SU-HSE) Daniel Karabekyan (SU-HSE) Remzi M. Sanver (Istanbul.
Chapter 13 Multiple Regression
Statistics for Managers Using Microsoft Excel, 4e © 2004 Prentice-Hall, Inc. Chap 11-1 Chapter 11 Chi-Square Tests and Nonparametric Tests Statistics for.
VI. Regression Analysis A. Simple Linear Regression 1. Scatter Plots Regression analysis is best taught via an example. Pencil lead is a ceramic material.
Slide Slide 1 Copyright © 2007 Pearson Education, Inc Publishing as Pearson Addison-Wesley. Overview.
1 EC9A4 Social Choice and Voting Lecture 2 EC9A4 Social Choice and Voting Lecture 2 Prof. Francesco Squintani
Manipulating the Quota in Weighted Voting Games (M. Zuckerman, P. Faliszewski, Y. Bachrach, and E. Elkind) ‏ Presented by: Sen Li Software Technologies.
Chapter 7 An Introduction to Portfolio Management.
Decision Theory Lecture 4. Decision Theory – the foundation of modern economics Individual decision making – under Certainty Choice functions Revelead.
Virtual University of Pakistan
Stats Methods at IC Lecture 3: Regression.
Machine Learning: Ensemble Methods
Chapter 10 Hypothesis Testing 1.
Chapter 12 Chi-Square Tests and Nonparametric Tests
Algorithms for Large Data Sets
Degree of Manipulability and Efficiency of Manipulation of Known Voting Rules in the Case of Multiple Choice Fuad Aleskerov (NRU HSE) Daniel Karabekyan.
Sampling Distributions and Estimation
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Applied Mechanism Design For Social Good
Saif Ullah Lecture Presentation Software to accompany Investment Analysis and.
Introduction If we assume
Chapter 9 Hypothesis Testing.
Discrete Event Simulation - 4
Manipulation Lirong Xia Fall, Manipulation Lirong Xia Fall, 2016.
Chap. 7 Regularization for Deep Learning (7.8~7.12 )
Voting systems Chi-Kwong Li.
Voting and social choice
Introduction to Social Choice
CPS 173 Voting and social choice
CPS Voting and social choice
Presentation transcript:

Social Choice Rules and their Manipulability Fuad Aleskerov National Research University Higher School of Economics and Institute of Control Sciences of Russian Academy of Sciences COST Meeting, Istanbul November 2-4, 2015 1

Authors Fuad Aleskerov (NRU HSE and Institute of Control Sciences) Daniel Karabekyan (NRU HSE) Remzi Sanver (Bilgi University) Vyacheslav Yakuba (NRU HSE and Institute of Control Sciences) Alexander Ivanov (Skoltech and NRU HSE) Website manip.hse.ru

1. Introduction Manipulability problem How can we evaluate a degree of manipulability of social choice procedures? Such procedures aggregate individual preferences, defined as an ordering of alternatives, into social choice, which may contain one or several alternatives. Our approach to the problem. In construction to build a house engineers check soil mechanic conditions and based on the number of floors of the building just look to the handbook and define how deep should be the base. Our idea is to construct such a handbook for colleagues working in the voting models. The tradition in this field when we deal with the manipulation phenomenon is to state the manipulability of the rules under different assumptions either to find domain or other type restriction preventing manipulability Main trends: single or multi-valued choices, individual or coalitional deviation of sincere preferences.

Background Gibbard (1973) and Satterthwaite (1975): every aggregation procedure is manipulable on unrestricted domain (if some rather weak conditions hold). Duggan, Swartz (2000), Ching, Zhou (2002) and Benoit (2002): the similar result for the case of multi-valued choice. Chamberlin (1985) and Nitzan (1985): first time studied the degree of manipulability of aggregation procedures. Kelly (1993) and Aleskerov, Kurbanov (1999) studied the degree of manipulability with the assumption of Impartial Culture (all profiles are equally likely) and alphabetical tie-breaking rule. Lepelley, Valognes (2003), Favardin, Lepelley (2006) and Pritchard, Wilson (2006): the problem for Impartial Anonymous Culture assumption (all voting situations are equally likely) and alphabetical tie-breaking rule. Aleskerov et al. (2011, 2012) estimated the degree of manipulability for the case of multi-valued choice (without using any tie-breaking rule) and for Impartial Culture (IC).

2. Aggregation procedures The research has been conducted on about 30 known aggregation procedures. The list of rules is as follows: Plurality rule Approval rule q=2,3 Inverse Plurality rule Borda’s rule Black’s procedure Minimal Dominant Set Minimal Undominated Set Minimal Weekly Stable Set Fishburn Rule Uncovered Set I,II Richelson rule Copeland rule I,II,III Simpson’s rule MinMax rule Strong q-Paretian simple majority Strong q-Paretian plurality Strongest q-Paretian simple majority Condorcet practical Threshold rule Nanson’s rule Inverse Borda’s rule Hare’s procedure 1,2,3-stable set Coombs rule We will remind definitions for several most important rules

Aggregation procedures

Aggregation procedures

3. General Notions The Model’s Parameters Overview Number of alternatives m = 3, 4, 5 Number of agents n = 3..100, each agent has a preference (linear order) over the set of alternatives 30 aggregation procedures with multi-valued choice Extended preferences (4 EP for 3 alternatives; 10 EP for 4 alternatives, 12 EP for 5 alternatives) to compare all possible social choices Impartial Culture and Impartial Anonymous Culture Individual and Coalitional manipulability

Impartial Culture and Impartial Anonymous Culture While in Impartial Culture (IC) model it is assumed that all profiles are equally likely, in Impartial Anonymous Culture (IAC) model the voting situations are equally likely, i.e. all profiles obtained by permutation of agents correspond to one voting situation.

Multi-valued choice While the rules are expected to give a single alternative as a choice result, in many cases the choice obtained is of set of several alternatives. Some rules yield single alternatives with high probability, but some do not. In the example of 5 alternatives and 91 agents, the Black and Borda rules produce single-valued choice in more than 95% of profiles, the Richelson and Copeland rules have only around 75% of such choice. And there are rules (such as Condorcet practical) which frequently return the full set of alternatives.

Strong and Weak Manipulability Strong manipulability: a voter can compare all possible social choices Strong manipulability extensions: Leximin, Leximax, Risk-averse, Risk-lover (for 3 alternatives) Weak manipulability: a voter can compare not all possible social choices Weak manipulability extensions: Kelly, Gardenfors-Zwicker, Expected Utility

Extended Preferences for Weak Manipulability For instance, Kelly extension: Social Choice 1 (SC1) is better than Social Choice 2 (SC2) if and only if all alternatives in SC1 are not worse than all alternatives in SC and there is at least one alternative in SC2 which is worse than one alternative in SC1 a b ab c ac bc abc 1 -1

Extended Preferences for Strong Manipulability The simple illustration of extended preferences in multiple choice model is the following. For three alternative let for some agent the preferences are a>b>c. How to compare two possible choice sets {a,c} and {b}? It depends on the additional assumptions about the agent, and it requires to define the extensions of the single-valued preferences to preferences on the sets. There are several extensions. Let us explain the Leximin extension. Consider two collective choices X,Y, and the agent's preferences P. If X and Y consist of equal number of elements, we sort elements of each set in the descending order according to the preferences P, and find the first position form top, on which the elements of the two sets differ. The set with better element in this position dominates the other set. If X and Y consist of different number of elements, we sort elements of each set in the ascending order, and look from the first elements in the ordering (from the worst element). Then we compare elements on the first position, on which elements differ. The set with better element in that position dominates. In elements of two seta are equal on each position in the ordering, than the wider set dominates.

Extended Preferences for Strong Manipulability Leximin extension for 3 alternatives looks as follows: The Leximax extension for 3 alternatives yields the following ordering:

Manipulability indices: NK Nitzan-Kelly index calculates the share of manipulable voting situations among all voting situations. - number of manipulating profiles - number of all profiles in IC model - number of all profiles in IAC model

Index of efficiency of manipulation, I2 - average benefit of manipulation in terms of ranks Two presented formulae show the indices normalized for the IC and IAC models

Index of efficiency of manipulation, I3 - maximum benefit of manipulation in terms of places Two formulae show the indices normalized for the IC and IAC models

Computational scheme The following computer modelling scheme to calculate manipulability indices is used: 1. Generate 1,000,000 profiles, separately for IAC and IC 2. For each profile we determine whether it is manipulable or not. A profile is considered manipulable if there is at least one agent who can manipulate, 3. If the profile is manipulable, we increase d0 index (number of manipulable profiles) by 1, 4. Calculate NK index by dividing d0 by the total number of generated profiles, i.e. 1,000,000. 5. Calculate I2 and I3 indices simultaneously with NK

Coalitional manipulability model The coalitional manipulation model assumes that the coalitions should contain agents with the same preferences, and insincere preferences submitted by agents of the coalition in the process of manipulation should be the same. The method for performing coalitional calculations is as follows. Since coalitions contain agents with the same preferences, it is enough to try to manipulate by one of the coalitions of the particular size, and then count the number of such coalitions, which can be constructed form the agents with the same preferences in a profile.

Results: manipulability The complete set of the results contains thousands of tables and obviously cannot be reprinted in any text. The complete set of the results can be found on the website manip.hse.ru

Results: manipulability All NK indices for IAC are decreasing with the growing number of agents. This is the same as in Impartial Culture. The explanation is pretty simple: as soon as we consider individual manipulability, the ‘weight’ of one’s preferences and its impact are decreasing with the growing number of agents. For most of aggregation procedures we can notice ‘periodical behavior’ of either 2 or 3 agents in their values. The same is true for NK index in Impartial Culture. Periods for aggregation procedures by the numbers of agents exist and seem to be the same as in the case of Leximin preferences extension method. 2-Approval rule is again the worst in terms of manipulability. Its values start even from 0.64, which stands for more than half manipulable profiles. There is no rule which is the least manipulable. Hare’s procedure shows best results at the beginning (small number of agents), but then it is surpassed by Nanson’s rule with the growing number of agents.

Results: manipulability There is no least manipulable procedure, but the following aggregation procedures show minimal manipulability in substantial number of cases: Hare’s procedure Nanson’s procedure Minimal Dominant Set Minimal Undominated Set The Third Copeland’s rule Fishburn’s rule

Individual manipulability, NK

Individual manipulability, leximin, m=3 Kelly’s index Individual manipulability, leximin, m=3

Individual manipulability, leximin, m=4

Individual manipulability, leximax, m=5 Kelly’s index Individual manipulability, leximax, m=5

Individual manipulability, leximax, m=3

Individual manipulability, leximin, m=4

Individual manipulability, leximin, m=5

Individual manipulability, leximax, m=4

Individual manipulability, leximax, m=5

Individual Manipulability, NK, IC

Individual Manipulability, NK, IC

Individual Manipulability, NK, IC

Individual Manipulability, NK, IC

Individual Manipulability, NK, IC

Individual Manipulability, NK, IAC

Individual Manipulability, NK, IAC

Individual Manipulability, NK, IAC

Individual Manipulability, NK, IAC

Individual Manipulability, NK, IAC

Individual manipulability, I - indices

Individual,leximin, m=3, n=3

Individual,leximin, m=3, n=5

Individual I1+, leximin, m=3

Individual I1=, leximin, m=3

Individual I1-, leximin, m=3

Coalitional manipulability

Coalitional manipulability, weak, IC NK index for m=5, calculated for IC model. Weak manipulability: Kelly extension.

Coalitional manipulability, strong, IC NK index for rules for m=5, calculated for IC model. Leximax extension.

Coalitional manipulability, weak, I1, IC I1+ index for m=5, calculated for IC model. Weak manipulability: Kelly extension.

Coalitional manipulability, strong, I1, IC I1+ index for rules for m=5, calculated for IC model. Leximax extension.

Coalitional manipulability, I1 index, IC

Coalitional manipulability, strong, I2, IC Average effectiveness of manipulability (I2) index for rules for m=5, calculated for IC model. Leximax extension.

Coalitional manipulability, strong, I3, IC Maximum effectiveness of manipulability (I3) index for rules for m=5, calculated for IC model. Leximax extension.

Coalitional manipulability, weak, IAC NK index for rules for m=5, calculated for IAC model. Weak manipulability: Kelly extension.

Coalitional manipulability, weak, I1, IAC I1+ index for rules for m=5, calculated for IAC model. Weak manipulability: Kelly extension.

Coalitional manipulability, strong, IAC NK index for rules for m=5, calculated for IAC model. Leximax extension.

Coalitional manipulability, strong, I1 IAC I1+ index for rules for m=5, calculated for IAC model. Leximax extension.

Coalitional manipulability, I1 index, IAC,

Coalitional manipulability, strong, I2 IAC Average effectiveness of manipulability (I2) index for rules for m=5, calculated for IAC model. Leximax extension.

Coalitional manipulability, strong, I3, IAC Maximum effectiveness of manipulability (I3) index for rules for m=5, calculated for IAC model. Leximax extension.

8. Manipulability and Decisiveness Some social choice rules show low manipulability, because they yield the whole set of alternatives for most profiles. It makes them not only almost non-manipulable under multi-valued choice, but also useless, because they do not actually make any choice at all. Decisiveness is the criterion which can be combined with manipulability indices to exclude such procedures.

Example Frequencies of choice sets m=5, n=25 One can see Condorcet practical with high frequency for "abc" choice set and Strong q-paretian simple majority with second high value.   abc Condorcet practical 0.93 Strong q-Paretian simple majority 0.19

D- index We construct the D-index for the case of m=3. Consider the frequencies of all choice sets. Let M1 be the sum of frequencies of all choices, which consist of only one alternative. Let M2 be the sum of frequencies of 2-alternative choices. And let M3 be the sum of frequencies of 3-alternative choices D-index is defined as the following sum: D= 1*M1+2*M2+3*M3, i.e. It is the sum of the number of alternatives in choice set, multiplied by cumulative frequencies of these sets.

Values of D-index There are 3 types of rules. Low values of D index: Plurality, Approval q=2, Inverse Plurality, Borda, Black, Simpson, MinMax, Strong q-Paretian plurality, Threshold, Nanson, Inverse Borda, Hare, Coombs, Approval q=3 for 4 alts. Average values: Minimal dominant set, Minimal undominated set, Minimal weekly stable set, Fishburn, Uncovered set I, Uncovered set II, Richelson, Copeland I, II, II, Strongest q-Paretian simple majority, 1,2, 3-stable set. Condorcet practical and Strong q-paretian simple majority rules have high values of D index

Nitzan-Kelly – D-index space

Decisiveness, m=4, n=100, IC

9. Conclusion Many aggregation procedures 3, 4, 5 alternatives, 3-100 agents (not all agents) Multi-valued choice, preference extensions: strong and weak Impartial Culture and Impartial Anonymous Culture Coalitional manipulability Manipulability indices: Nitzan-Kelly and effectiveness I2, I3 Decisiveness

Thank you! manip.hse.ru

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Appendix 1. Definitions of aggregation rules

Extended preferences Axiomatic definition of Leximin

Extended preferences