Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Slides:



Advertisements
Similar presentations
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Advertisements

Computational Game Theory Amos Fiat Spring 2012
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Voting Methods Continued
Presented by: Katherine Goulde
Voting and social choice Vincent Conitzer
1 EC9A4 Social Choice and Voting Lecture 3 EC9A4 Social Choice and Voting Lecture 3 Prof. Francesco Squintani
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
Voting and social choice Looking at a problem from the designers point of view.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
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.
Public Finance (MPA405) Dr. Khurrum S. Mughal.
Computational Democracy: Algorithms, Game Theory, and Elections Steven Wolfman 2011/10/27.
How “impossible” is it to design a Voting rule? Angelina Vidali University of Athens.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
CS 886: Electronic Market Design Social Choice (Preference Aggregation) September 20.
Making Group Decisions Mechanism design: study solution concepts
Arrow’s impossibility theorem EC-CS reading group Kenneth Arrow Journal of Political Economy, 1950.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
Excursions in Modern Mathematics Sixth Edition
Using a Modified Borda Count to Predict the Outcome of a Condorcet Tally on a Graphical Model 11/19/05 Galen Pickard, MIT Advisor: Dr. Whitman Richards,
Voting Review Material
Motivation: Condorcet Cycles Let people 1, 2 and 3 have to make a decision between options A, B, and C. Suppose they decide that majority voting is a good.
Ties Matter: Complexity of Voting Manipulation Revisited based on joint work with Svetlana Obraztsova (NTU/PDMI) and Noam Hazon (CMU) Edith Elkind (Nanyang.
Alex Tabarrok Arrow’s Theorem.
CPS Voting and social choice
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 April 20, 2005
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.
Social choice theory = preference aggregation = truthful voting Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Social choice (voting) Vincent Conitzer > > > >
Arrow’s Impossibility Theorem
CPS Voting and social choice Vincent Conitzer
1 Self-government and Impossibility Theorem: How to find a good allocation mechanism? Anita Gantner Wolfgang Höchtl Rupert Sausgruber University of Innsbruck.
Chapter 12 Decision Rights The Level of Empowerment.
Elections and Strategic Voting: Condorcet and Borda E. Maskin Harvard University.
1 Elections and Manipulations: Ehud Friedgut, Gil Kalai, and Noam Nisan Hebrew University of Jerusalem and EF: U. of Toronto, GK: Yale University, NN:
Chapter 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
Assoc. Prof. Yeşim Kuştepeli1 VOTING GAMES. Assoc. Prof. Yeşim Kuştepeli2 Outline Choosing Among Voting Mechanisms Majority Rule with Two Choices Plurality.
Math for Liberal Studies.  We have seen many methods, all of them flawed in some way  Which method should we use?  Maybe we shouldn’t use any of them,
Great Theoretical Ideas in Computer Science.
Let’s take a class vote. How many of you are registered to vote?
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Arrow’s Impossibility Theorem. Question: Is there a public decision making process, voting method, or “Social Welfare Function” (SWF) that will tell us.
Empirical Aspects of Plurality Elections David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland.
How Should Presidents Be Elected? E. Maskin Institute for Advanced Study.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,
Social Choice Lectures 14 and 15 John Hey. Lectures 14 and 15: Arrow’s Impossibility Theorem and other matters Plan of lecture: Aggregation of individual.
Voting System Review Borda – Sequential Run-Off – Run-Off –
Arrow’s Impossibility Theorem
Algorithms for Large Data Sets
Impossibility and Other Alternative Voting Methods
1.
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Applied Mechanism Design For Social Good
Algorithmic Analysis of Elections: Voting Rules and Manipulability (minicourse) Piotr Faliszewski AGH University Kraków, Poland.
Impossibility and Other Alternative Voting Methods
1.3 The Borda Count Method.
Alex Tabarrok Arrow’s Theorem.
Social Choice Theory [Election Theory]
Voting systems Chi-Kwong Li.
Voting and social choice
CPS 173 Voting and social choice
Section 14.1 Voting Methods.
CPS Voting and social choice
Presentation transcript:

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA

Lecture Twenty-Six: Voting.

Group decision-making A jury’s verdict US presidential elections Ranking of college football teams Ranking of search results Netflix recommendation system

Voters Arrow Borda Condorcet

Alternatives chocolate strawberry vanilla

Rankings Arrow Arrow prefers strawberry to chocolate. chocolate strawberry

Rankings

Problem Given: Set of voters, set of alternatives, rankings Output: Global ranking of alternatives

Assumptions 1.Rankings are complete. Each voter has an opinion about each pair of alternatives. ?? ? ?? ?

Assumptions 2.Rankings are transitive.

In other words, … Assumptions imply rankings are complete rank-ordered lists.

Question How can we combine individual rankings to produce a group ranking of the alternatives?

Voting schemes Majority Dictatorship Electoral college Consensus Borda count Which scheme works best? … always produces a valid ranking … is not subject to manipulation … makes the “right” decision

Majority rule Two alternatives: Three alternatives?

Majority rule For every pair of alternatives X and Y, Rule. Rank X above Y if more voters rank X Y than Y X

Majority with 3 alternatives XYZYZXZXYXYZYZXZXY Majority XYXY YZYZ ZXZX Majority is not transitive

XYZYZXZXYXYZYZXZXY For any winner, there is another winner a majority of voters prefer: e.g., If X wins, 2 and 3 would prefer Z Condorcet triple

Are these preferences sensible? Che GuevaraJohn McCainBarack Obama

Single-peaked preferences CheCheneyObamaColbertMcCain Far left Far right

CheCheneyObamaColbertMcCain value Single-peaked: just one maximum

CheCheneyObamaColbertMcCain Y If for all candidates Y, then:

Result Majority works for single-peaked preferences! (it always outputs a transitive ranking)

Who should win? CheCheneyObamaColbertMcCain # 1 st votes:(100 voters) Obama is the median alternative, i.e., the middle of the best alternatives.

Majority winner CheCheneyObamaColbertMcCain # 1 st votes:(100 voters) All these voters prefer Obama to Che or Colbert. All these voters prefer Obama to McCain or Cheney. = 85 voters > ½ the voters (since Obama is median alternative). Obama beats McCain and Cheney in Majority Rule. ½ voters < 50 voters = (since Obama is median alternative). Obama beats Colbert and Che in Majority Rule.

Majority winner CheCheneyObamaColbertMcCain # 1 st votes:(100 voters) Obama is the median alternative, and the majority winner.

Fact. For single-peaked preferences, majority winner = median alternative!

Borda count Rule. Assign a score to each alternative based on rank, output rank-by-score. (break ties alphabetically)

Computing Borda count Borda 321

Fact. Borda count always produces a complete transitive ranking.

Voting in Borda count Experiment: ZYXYXZXZYZYXYXZXZY YOU: If you elect: Z: 2 pts.Y: 1 pt.X: 0 pts.

YOU: Problem with Borda Then elect X (break ties alphabetically). Then elect Y ZYX YXZ XZY

Problem with Borda Borda

Problem with Borda Highest-ranked alternative can change depending on how individuals rank low- ranked alternatives.

Reasonable voting schemes 1.Produce a complete transitive ranking. 2.Pareto Principle: If everyone prefers X to Y, rank X before Y. 3.Independence of Irrelevant Alternatives: For any three alternatives X, Y, and Z, group ranking of X and Y does not depend on how individuals rank Z.

Arrow’s impossibility result Only reasonable voting scheme is dictatorship. (or, if you prefer, there is no reasonable voting scheme) Pick an arbitrary voter and output her ranking.

But, … Information aggregation: There is a “correct” alternative but each voter has a noisy signal. Stability to noise: Each voter’s vote is subjected to some random noise. Majority rules (and dictators drool)

Trial A man stands accused of a horrible crime. The jury (voters).The verdict (alternatives).

Information aggregation Each voter receives a signal about the truth. Distortion flips the truth with probability p < 1/2 The unvarnished truth

Voting to aggregate information How should the jury vote? Majority rule aggregates information. How should this be implemented?

Sequential voting? NO! Information cascades.

Simultaneous voting? Problem: Sincerity. Suppose it is really bad for society to convict an innocent man. If even one jury member receives an innocent signal, the man should be acquitted.

Simultaneous voting A jury of three with two alternatives: Alternative A is better if any voter sees A. Scenario 1: AABBAB Doesn’t matter. Scenario 2:Scenario 3: I better vote A!

Simultaneous voting For majority: Sincere voting is not a Nash equilibrium. You should always vote as if you’re pivotal.

Next time Epilogue.