Making Better Group Decisions: Voting, Judgement Aggregation and Fair Division

Course
en
English
7 h
This content is rated 0 out of 5
Source
  • From www.coursera.org
Conditions
  • Self-paced
  • Free Access
  • Free certificate
More info
  • 7 Sequences
  • Introductive Level

Their employees are learning daily with Edflex

  • Safran
  • Air France
  • TotalEnergies
  • Generali
Learn more

Course details

Syllabus

Week 1:  Voting Methods
    The Voting Problem
    A Quick Introduction to Voting Methods (e.g., Plurality Rule, Borda Count,  
          Plurality with Runoff, The Hare System, Approval Voting)    
    Preferences
    The Condorcet Paradox
    How Likely is the Condorcet Paradox?
    Condorcet Consistent Voting Methods
    Approval Voting
    Combining Approval and Preference
    Voting by Grading

Week 2: Voting Paradoxes
    Choosing How to Choose
    Condorcet's Other Paradox
    Should the Condorcet Winner be Elected?
    Failures of Monotonicity
    Multiple-Districts Paradox
    Spoiler Candidates and Failures of Independence
    Failures of Unanimity
    Optimal Decisions or Finding Compromise?
    Finding a Social Ranking vs. Finding a Winner

Week 3: Characterizing Voting Methods
    Classifying Voting Methods
    The Social Choice Model
    Anonymity, Neutrality and Unanimity
    Characterizing Majority Rule
    Characterizing Voting Methods
    Five Characterization Results
    Distance-Based Characterizations of Voting Methods
    Arrow's Theorem
    Proof of Arrow's Theorem
    Variants of Arrow's Theorem

Week 4: Topics in Social Choice Theory
    Introductory Remarks
    Domain Restrictions: Single-Peakedness
    Sen’s Value Restriction
    Strategic Voting
    Manipulating Voting Methods
    Lifting Preferences
    The Gibbard-Satterthwaite Theorem
    Sen's Liberal Paradox

Week 5: Aggregating Judgements
    Voting in Combinatorial Domains
    Anscombe's Paradox
    Multiple Elections Paradox
    The Condorcet Jury Theorem
    Paradoxes of Judgement Aggregation
    The Judgement Aggregation Model
    Properties of Aggregation Methods
    Impossibility Results in Judgement Aggregation
    Proof of the Impossibility Theorem(s)

Week 6: Fair Division 
    Introduction to Fair Division
    Fairness Criteria
    Efficient and Envy-Free Divisions
    Finding an Efficient and Envy Free Division
    Help the Worst Off or Avoid Envy?
    The Adjusted Winner Procedure
    Manipulating the Adjusted Winner Outcome

Week 7:  Cake-Cutting Algorithms
   The Cake Cutting Problem
   Cut and Choose
   Equitable and Envy-Free Proocedures
   Proportional Procedures
   The Stromquist Procedure
   The Selfridge-Conway Procedure
   Concluding Remarks

Prerequisite

None.

Instructors

  • - Philosophy

Editor

The University of Maryland is the state's flagship university and one of the nation's leading public research universities. A world leader in research, entrepreneurship and innovation, the university is home to more than 37,000 students, 9,000 faculty and staff, and 250 academic programs. 

Its faculty includes three Nobel laureates, three Pulitzer Prize winners, 47 members of national academies and a large number of Fulbright scholars. The institution has an operating budget of $1.8 billion, raises $500 million a year in external research funding and recently completed a $1 billion fundraising campaign.

Platform

Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California. 

Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.

This content is rated 4.5 out of 5
(no review)

What did you think of this course?

Complete this resource to write a review