Extending Arrow’s Theorem to --- just about everything Multi scale analysis; in particular for systems: How are activities of systems at different scales.

Slides:



Advertisements
Similar presentations
CP nets Toby Walsh NICTA and UNSW. Representing preferences Unfactored Not decomposable into parts E.g. assign utility to each outcome Factored Large.
Advertisements

Chapter 10: The Manipulability of Voting Systems Lesson Plan
Web Information Retrieval
Voting and social choice Vincent Conitzer
1 Public choice Alexander W. Cappelen Econ
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
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.
Mark Wang John Sturm Sanjeev Kulkarni Paul Cuff.  Basic Background – What is the problem?  Condorcet = IIA  Survey Data  Pairwise Boundaries = No.
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.
Alternative Economic Systems Learning Plan 4 Questions 1. Why does the scarcity problem force all societies to answer the questions what, how, and for.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
CS 886: Electronic Market Design Social Choice (Preference Aggregation) September 20.
Arrow’s impossibility theorem EC-CS reading group Kenneth Arrow Journal of Political Economy, 1950.
Frank Cowell: Welfare Basics WELFARE: BASICS MICROECONOMICS Principles and Analysis Frank Cowell Useful, but optional Consumption basics Useful, but optional.
“Geometry of Departmental Discussions” Donald G. Saari Institute for Mathematical Behavioral Sciences University of California, Irvine Voting.
Using the Crosscutting Concepts As conceptual tools when meeting an unfamiliar problem or phenomenon.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
But, how?? Explaining all possible positional, pairwise voting paradoxes & prop. Don Saari Institute for Math Behavioral Sciences University of California,
MAT 105 Spring  As we have discussed, when there are only two candidates in an election, deciding the winner is easy  May’s Theorem states that.
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,
Math for Liberal Studies.  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss.
Frank Cowell: Microeconomics Welfare: Basics MICROECONOMICS Principles and Analysis Frank Cowell Useful, but optional Consumption basics Useful, but optional.
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.
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.
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.
We vote, but do we elect whom we really want? Don Saari Institute for Mathematical Behavioral Sciences University of California, Irvine, CA
Reshef Meir School of Computer Science and Engineering Hebrew University, Jerusalem, Israel Joint work with Maria Polukarov, Jeffery S. Rosenschein and.
Social choice theory = preference aggregation = truthful voting Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Social choice (voting) Vincent Conitzer > > > >
Overview Aggregating preferences The Social Welfare function The Pareto Criterion The Compensation Principle.
Voting Geometry: A Mathematical Study of Voting Methods and Their Properties Alan T. Sherman Dept. of CSEE, UMBC March 27, 2006.
Arrow’s Impossibility Theorem
Fundamentals of Political Science Dr. Sujian Guo Professor of Political Science San Francisco State Unversity
Alex Tabarrok. Individual Rankings (Inputs) BDA CCC ABD DAB Voting System (Aggregation Mechanism) Election Outcome (Global Ranking) B D A C.
Donald G. Saari Institute for Mathematical Behavioral Sciences University of California, Irvine The surprising complexity of economics.
Donald G. Saari Institute for Mathematical Behavioral Sciences University of California, Irvine The responsibility.
Chapter 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
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.
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Section 9.1 Great Expectations Deciding How to Weigh the Unknown Future Chance favors only the prepared mind. Louis Pasteur.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Arrow’s Impossibility Theorem. Question: Is there a public decision making process, voting method, or “Social Welfare Function” (SWF) that will tell us.
Copyright © 2009 Pearson Education, Inc. Chapter 11 Understanding Randomness.
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.
Arrow’s Impossibility Theorem
1.
© 2014 Networking for Information Communications and Energy Lab. Why does Wikipedia even work? Prof. Hongseok Kim Sogang University, EE Networked Life:
Algorithms for Large Data Sets
1 The Mathematics of Voting
Impossibility and Other Alternative Voting Methods
1.
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Introduction to Social Choice
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
Impossibility and Other Alternative Voting Methods
Introduction If we assume
Elections with More Than Two Candidates
Alex Tabarrok Arrow’s Theorem.
Voting systems Chi-Kwong Li.
Voting and social choice
Introduction to Social Choice
Quiz – 1/24 - Friday How many people voted in the election?
CPS Voting and social choice
Presentation transcript:

Extending Arrow’s Theorem to --- just about everything Multi scale analysis; in particular for systems: How are activities of systems at different scales connected? Basic issue in the social and behavioral sciences Economics Engineering Physical sciences Complexity History: NSF, nano-technology Specialization, understand behavior of individual parts use experts, use physical laws, or other info to find behavior of individual parts Don Saari, Institute for Math Behavioral Sciences University of California, Irvine, CA

Examples: Astronomy; e.g., galaxy: find mass, rotational velocity, luminosity Nano-technology: Find behavior of various parts Consequences: Serious incompatibilities: multiples of 50 to 100 off source of dark matter Biological systems have the first level of organization at the nanoscale. Proteins, DNA, RNA, ion channels are nanoscale systems that leverage molecular interactions to perform specific tasks. Integrated nano-bio systems have emerged as strong candidates for single molecule detection, genomic sequencing, and the harnessing of naturally occurring biomotors. Design of integrated nano-bio devices can benefit from simulation, just as the design of microfluidic devices have benefited. Currently a large stumbling block is the lack of simulation methods capable of handling nanoscale physics, device level physics, and the coupling of the two. Complexity? or wrong methodology? Engineering: Division of labor, experts, develop parts, optimize Reality: Cannot handle connections between different levels of systems Inefficiency, mistakes NIAAA

Arrow’s Theorem Inputs: Voter preferences are transitive No restrictions Output: Societal ranking is transitive Voting rule: Pareto: Everyone has same ranking of a pair, then that is the societal ranking Binary independence (IIA): The societal ranking of a pair depends only on the voters’ relative ranking of pair Conclusion: With three or more alternatives, rule is a dictatorship No voting rule is fair! Notice: Emphasis on “parts,” Simple examples of multiscale systems Group decisions; voting, etc. Also notice, “whole” exists: Plurality, Borda rankings, etc. Alternative conclusion: With three or more alternatives, if one voter does not make all of the decisions, then there must exist situations where the “whole need not resemble the collection of the parts” Maybe this interpretation extends; maybe for most systems, there exist settings where “whole need not resemble parts” part-whole conflict This is the case

For a price... I will come to your organization for your next election. You tell me who you want to win. After talking with everyone, I will design a “fair” election rule. Your candidate will win. 10 A>B>C>D>E>F 10 B>C>D>E>F>A 10 C>D>E>F>A>B Decision for each part is “optimal” Outcome is inferior Multiscale outcomes can be inferior when built on parts Everyone prefers C, D, E, to F D E C B A F D C B A F F wins with 2/3 vote!! A landslide victory!! Consequences: Evidence “strongly” supports conclusion of F! i.e., with “parts”, expect path dependency

Developing the result Arrow Inputs: Voter preferences are complete & transitive. No restrictions Arrow’s Output: Societal ranking is complete, transitive Macro system Micro three compatibility conditions: Mine: 1) All elements are needed 2) some combinations are not compatible 3) compensative Message: Beware; evidence may appear to provide overwhelming support about the existence of a connection, a result, etc., yet it can be wrong Positive results are being developed Mine: Structure satisfies compatibility conditions: 1) all elements are needed, 2) some combinations are not compatible, 3) compensative Pareto: If all participants agree on the feature for some component, then that is the macro outcome Independence: The outcome for each component depends only on each participant’s input for that component Conclusion: with systems having three or more parts, there exist settings where “whole does not resemble collection of parts” One of several mass velocity luminosity design manufacturing sales Might define outcome, but an inferior one! (Path dependency) Each “participant” selects compatible input, no restriction

Consequences: Nano-technology conference Astronomy; dark matter: Madrid

Resolution? To do so, first have to handle and resolve the “easier” Arrow’s Theorem. Inputs: Voter preferences are transitive No restrictions Output: Societal ranking is transitive Rule: Pareto: Everyone has same ranking of a pair, then that is the societal ranking Binary independence (IIA): The societal ranking of a pair depends only on the voters’ relative ranking of pair Conclusion: With three or more alternatives, rule is a dictatorship With Red wine, White wine, Beer, I prefer R>W. Are my preferences transitive? Cannot tell; need more information Determining societal ranking You need to know my {R, B} and {W, B} rankings! cannot use info that voters have transitive preferences Modify!! And transitivity Borda 2, 1, 0 Coordinated symmetry Illustrate: solve voting problem Lost information: about “connections” Here, “connections” means transitivity A>B, B>C implies A>C

Cambridge University press Consequences -- so far: Engineering: Manufacturing Conference Statistics: Nonparametric Kruskal-Wallis Voting: Understanding all voting paradoxes--connections Astronomy: Partial results (paper on dark matter) Work in progress: Approach for all areas now is understood; must be developed Complexity--mainly multiscale problems International relations evolutionary game theory addiction? maybe etc., etc., etc.

AnnConnieEllen BobDavidFred ScienceSoc. ScienceHistory Vote for one from each column Three voters Bob David Fred 2:1 Representative outcome? Ann, Connie, Ellen; Bob, Dave, Fred Bob, Dave, Fred Ann, David, Ellen; Bob, Connie, Fred Bob, Dave, Fred Ann, Connie, Fred; Bob, Dave, Ellen; Bob, Dave, Fred Ann, Dave, Fred; Bob, Connie, Ellen; Bob, Dave, Fred Ann, Dave, Fred; Bob, Connie, Fred; Bob, David, Ellen Mixed gender! Outlier: Pairwise vote not designed to recognize any condition imposed among pairs Five profiles INCLUDING Transitivity! 2001, APSR with K. Sieberg Ethnic groups, etc., etc.

Ann Bob Connie David Ellen Fred Bob = A>B, Ann = B>A B>A A>B Connie= C>B, Dave= B>C C>B B>C Ellen = A>C, Fred = C>A A>C C>A Ann, Dave, Fred; Bob, Connie, Fred; Bob, David, Ellen B>C>A C>A>B A>B>C The Condorcet triplet! Mixed Gender = Transitivity!! Ann, Connie, Ellen; Bob, Dave, Fred; Bob, Dave, Fred 2) A>B, B>C, C>A 1) B>A, C>B, A>C So, “pairwise” forces certain profiles to be treated as being cyclic!! also IIA, etc. APSR, Saari-Sieberg, result-- average of all profiles Name change “Pairwise emphasis” severs intended connections Lost information Sen, etc. Z3Z3