MoL-2021-10: Ade, Leyla (2021) Iterative Goal-Based Voting. [Report]
![[thumbnail of MoL-2021-10.text.pdf]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text
MoL-2021-10.text.pdf Download (1MB) |
Abstract
Goal-based voting is a new voting framework in which agents can submit propositional formulae as their goals. We study iterated applications of the majorities and approval rules in this framework. We introduce notions of satisfaction based on the Hamming distance between an agent’s goal and the interpretations in the outcome under a given rule. The contribution of this thesis is twofold: First, we analyze the convergence of the iteration. We show that the Majority rules and the Approval rule for some satisfaction functions are not guaranteed to terminate, while other cases of Approval voting do always converge. Second, we study the quality of iteration. The first part of this analysis consists of theoretical results, showing that in cases where termination of Approval voting is guaranteed we also have an improvement of the social welfare. The second part consists of an implementation of the iterative process in Python for the cases not covered by our theoretical results, which gives us preliminary insights on the frequency and quality of iteration.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2021-10 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2021 |
| Subjects: | Logic Mathematics |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 12 Aug 2021 11:38 |
| Last Modified: | 12 Aug 2021 11:38 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1800 |
Actions (login required)
 |
View Item |
