Show simple item record

dc.contributor.authorMehra, Kanav
dc.date.accessioned2023-08-18 14:58:58 (GMT)
dc.date.available2023-08-18 14:58:58 (GMT)
dc.date.issued2023-08-18
dc.date.submitted2023-08-04
dc.identifier.urihttp://hdl.handle.net/10012/19713
dc.description.abstractFairness through proportionality has received significant attention in recent social choice research, leading to the development of advanced tools, methods, and algorithms aimed at ensuring fairness in democratic institutions. Citizen-focused democratic processes where participants deliberate on alternatives and then vote to make the final decision are increasingly popular today. While the computational social choice literature has extensively investigated voting rules, there is limited work that explicitly looks at the interplay of the deliberative process and voting. In this thesis, we build a deliberation model using established models from the opinion-dynamics literature and study the effect of different deliberation mechanisms on voting outcomes achieved when using well-studied voting rules. Our results show that deliberation generally improves welfare and representation guarantees, but the results are sensitive to how the deliberation process is organized. We also show, experimentally, that simple voting rules, such as approval voting, perform as well as more sophisticated rules such as proportional approval voting or method of equal shares if deliberation is properly supported. This has ramifications on the practical use of such voting rules in citizen-focused democratic processes. Intricately designed proportional voting rules offer robust theoretical and axiomatic fairness guarantees that can prove valuable in similar scenarios beyond the realm of elections. In the second part, we capitalize on these properties and introduce innovative fair-ranking algorithms based on proportional voting methods. Specifically, we define the general task of fair ranking, which involves generating a list of items that is fairly ordered with respect to a given query, as a voting problem. Our findings reveal that proportional voting rules deliver exceptional performance, frequently matching or surpassing the performance of existing benchmarks in terms of aggregate fairness and relevance metrics. These discoveries present exciting avenues for further research and applications, endorsing the widespread adoption of proportional voting rules in domains where fairness is a priority.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.relation.urihttps://github.com/kanav-mehra/deliberation-votingen
dc.subjectapproval votingen
dc.subjectcommittee electionsen
dc.subjectproportional fairnessen
dc.subjectranking systemsen
dc.subjectparticipatory democracyen
dc.subjectsocial choiceen
dc.titleProportionality and Fairness in Voting and Ranking Systemsen
dc.typeMaster Thesisen
dc.pendingfalse
uws-etd.degree.departmentDavid R. Cheriton School of Computer Scienceen
uws-etd.degree.disciplineComputer Scienceen
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws-etd.embargo.terms0en
uws.contributor.advisorLarson, Kate
uws.contributor.affiliation1Faculty of Mathematicsen
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages