Editing
Social Choice Theory
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
<div style="background-color: #4B0082; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;"> {{BloomIntro}} Social Choice Theory is the study of how individual preferences are combined to make a "Group Decision." While we often think of "Voting" as a simple matter of counting heads, this field proves that there is mathematically **No Perfect Way** to vote. Discovered by economists like Kenneth Arrow, social choice theory reveals that every voting system—whether it's "Winner-Take-All" or "Ranked Choice"—has a built-in "Flaw" that can lead to unfair results. By understanding these mathematical limits, we can design better democracies, fairer committees, and more stable societies. </div> __TOC__ <div style="background-color: #000080; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;"> == <span style="color: #FFFFFF;">Remembering</span> == * '''Social Choice Theory''' — The analysis of collective decision-making and how individual views become a single group choice. * '''Arrow's Impossibility Theorem''' — The mathematical proof that no voting system can satisfy a specific set of "Fairness" criteria simultaneously. * '''Condorcet Paradox''' — A situation where a group prefers A over B, B over C, and C over A (a "Cycle" with no winner). * '''Ranked Choice Voting (RCV)''' — A system where voters list candidates in order of preference (1st, 2nd, 3rd). * '''Borda Count''' — Assigning points to ranks (e.g., 3 points for 1st place, 2 for 2nd) and summing them up. * '''Gibbard-Satterthwaite Theorem''' — The proof that almost every voting system can be "Gamed" by strategic voting (lying about your preference). * '''Independence of Irrelevant Alternatives (IIA)''' — The idea that the choice between A and B shouldn't change just because a third candidate (C) enters the race. * '''Dictatorship Criterion''' — The requirement that the group's decision shouldn't just be whatever one single person wants. </div> <div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;"> == <span style="color: #FFFFFF;">Understanding</span> == Social choice theory is understood through '''Mathematical Impossibility''' and '''Strategic Behavior'''. '''1. The Voting Paradox (Condorcet)''': Imagine three friends (X, Y, Z) are choosing between Pizza (P), Tacos (T), and Sushi (S). * X likes P > T > S * Y likes T > S > P * Z likes S > P > T If they vote on pairs: * 2 out of 3 prefer Pizza over Tacos. * 2 out of 3 prefer Tacos over Sushi. * 2 out of 3 prefer Sushi over Pizza! The group has no "Rational" choice. This is why committees often get stuck in loops. '''2. Arrow's "Impossibility"''': Kenneth Arrow proved that if you want a voting system that is: # '''Rational''' (No loops like above). # '''Universal''' (Can handle any set of rankings). # '''Pareto Efficient''' (If everyone prefers A over B, the group picks A). # '''Non-Dictatorial''' (No one person decides). # '''Independent''' (No "Spoilers"). ...It is mathematically **impossible** for all five to be true at once. '''3. Strategic Voting (The Lie)''': In many systems, if you know your favorite candidate can't win, you might vote for your "Second Choice" to stop your "Least Favorite" from winning. Social choice theory proves that this is a "Feature," not a "Bug"—almost all systems encourage this kind of strategic behavior. '''The Median Voter Theorem''': In a two-party system, candidates will always move toward the "Middle" of the political spectrum to capture the 51% of voters who are in the center. </div> <div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;"> == <span style="color: #FFFFFF;">Applying</span> == '''Modeling 'The Borda Count' (Calculating a winner from ranks):''' <syntaxhighlight lang="python"> def calculate_borda_winner(votes): """ 1st place = 2 pts, 2nd = 1 pt, 3rd = 0 pts """ scores = {'A': 0, 'B': 0, 'C': 0} for vote in votes: scores[vote[0]] += 2 # 1st choice scores[vote[1]] += 1 # 2nd choice # 3rd choice gets 0 return scores # 3 Voters: v1 = ['A', 'B', 'C'] v2 = ['B', 'C', 'A'] v3 = ['C', 'B', 'A'] print(f"Borda Scores: {calculate_borda_winner([v1, v2, v3])}") # Result: B wins (4 pts) even though A, B, and C each had # one '1st place' vote. B wins because they were everyone's 2nd choice. </syntaxhighlight> ; Voting Landmarks : '''The 2000 US Election''' → A classic example of the "Spoiler Effect" (IIA violation), where Ralph Nader's presence potentially changed the outcome between Bush and Gore. : '''Nobel Prize (1972)''' → Kenneth Arrow won the Nobel for proving that "Perfect Democracy" is mathematically impossible. : '''Alaska & Maine''' → The first US states to adopt "Ranked Choice Voting" to try to fix some of the flaws of the standard system. : '''The Jury Theorem''' → Condorcet's positive theory: a group of people is more likely to be right than a single expert, provided each person is at least 51% likely to be right. </div> <div style="background-color: #8B4500; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;"> == <span style="color: #FFFFFF;">Analyzing</span> == {| class="wikitable" |+ Voting Systems Compared ! System !! Pros !! Cons |- | Plurality (Standard) || Simple and fast || High "Spoiler" effect; minority wins |- | Ranked Choice || Eliminates spoilers || Complex to count; can be gamed |- | Borda Count || Finds the 'Consensus' || Easy to manipulate by 'Burial' |- | Approval Voting || No "Splitting the vote" || Hard to express 'Intensity' of preference |} '''The Concept of "Coalition Stability"''': Analyzing why some groups stay together while others fall apart. If a group decision is "Unstable" (meaning a majority would prefer a different choice), the group will eventually collapse into infighting. </div> <div style="background-color: #483D8B; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;"> == <span style="color: #FFFFFF;">Evaluating</span> == Evaluating social choice theory: # '''The 'Lesser of Two Evils'''': Is it better to have a system that finds a "Consensus" (like Borda) or one that rewards "Passion" (like Plurality)? # '''Strategic Voting''': Is it "Dishonest" to vote for your second choice, or is it just being "Smart"? # '''AI and Choice''': Should we let AI "Aggregate" our preferences into a single social choice? (The "Alignment Problem"). # '''Democratic Health''': If no system is perfect, how do we decide which "Imperfections" we are willing to live with? </div> <div style="background-color: #2F4F4F; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;"> == <span style="color: #FFFFFF;">Creating</span> == Future Frontiers: # '''Quadratic Voting''': A new system where voters can "Buy" extra votes for things they care about, but the price of each extra vote increases quadratically (to prevent the wealthy from dominating). # '''Liquid Democracy''': A digital system where you can vote on every issue yourself OR "Delegate" your vote to a trusted friend or expert in real-time. # '''Blockchain Governance''': Using "Smart Contracts" to run fair voting systems that can't be "Stuffed" or "Hacked." # '''Collaborative Filtering''': Using the math of social choice to help "Groups" (like Netflix users) decide what to watch or buy next. [[Category:Mathematics]] [[Category:Economics]] [[Category:Political Science]] </div>
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Template used on this page:
Template:BloomIntro
(
edit
)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information