Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Resolving the Optimal Metric Distortion Conjecture

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 21-minute IEEE conference talk on the Optimal Metric Distortion Conjecture in voting theory. Delve into the Downseam Proximity Model and discover the concept of lowest possible distortion. Examine the Domination Graph and understand the Ranking Matching Lemma. Follow the proof and unravel the Ranking Match Dilemma. Learn about Fractional Perfect Match and its implications. Presented by Vasilis Gkatzelis from Drexel University, along with Daniel Halpern and Nisarg Shah from the University of Toronto, this talk provides a comprehensive overview of resolving this important conjecture in the field of voting theory.

Syllabus

Introduction
Voting Theory
Downseam Proximity Model
Lowest Possible Distortion
Domination Graph
Ranking Matching Lemma
Proof
Ranking Match Dilemma
Fractional Perfect Match
Conclusion

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Resolving the Optimal Metric Distortion Conjecture

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.