- From www.coursera.org
Making Better Group Decisions: Voting, Judgement Aggregation and Fair Division
МООК
en
Английский
7 h
This content is rated 0 out of 5
- Self-paced
- Free Access
- Бесплатный сертификат
- 7 Sequences
- Introductive Level
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)
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
L'université du Maryland est l'université phare de l'État et l'une des principales universités publiques de recherche du pays. Leader mondial en matière de recherche, d'entrepreneuriat et d'innovation, l'université accueille plus de 37 000 étudiants, 9 000 membres du corps enseignant et du personnel, et 250 programmes académiques.
Son corps professoral compte trois lauréats du prix Nobel, trois lauréats du prix Pulitzer, 47 membres des académies nationales et un grand nombre de chercheurs Fulbright. L'institution dispose d'un budget de fonctionnement de 1,8 milliard de dollars, obtient 500 millions de dollars par an en financement externe de la recherche et a récemment achevé une campagne de collecte de fonds d'un milliard de dollars.
Platform
Coursera - это цифровая компания, предлагающая массовые открытые онлайн-курсы, основанные учителями компьютеров Эндрю Нгом и Стэнфордским университетом Дафни Коллер, расположенные в Маунтин-Вью, штат Калифорния.
Coursera работает с ведущими университетами и организациями, чтобы сделать некоторые из своих курсов доступными в Интернете, и предлагает курсы по многим предметам, включая: физику, инженерию, гуманитарные науки, медицину, биологию, социальные науки, математику, бизнес, информатику, цифровой маркетинг, науку о данных и другие предметы.
This content is rated 4.5 out of 5
(no review)This content is rated 4.5 out of 5
(no review)Complete this resource to write a review