Verified Construction of Approval-Based Committee Voting Rules
Forschungsthema: | Computational Social Choice |
---|---|
Typ: | |
Datum: | 2025-04-11 |
Betreuer: | Michael Kirsten |
Aushang: |
Abstract
Decision-making processes like the collective scheduling of a meeting, range design in a store or political elections concern the aggregation of preferences, but may have widely different requirements on a potential outcome. This has led to the formulation and study of a variety of voting rules, which formally describe such collective decision-making processes. Approval-based committee (ABC) voting rules are one important class of voting rules.
In this work, I introduce the concept of aggregate profiles as a means of abstracting similarities in preference aggregation between voting rules. An aggregate profile intuitively limits the information on voters' ballots and possible election outcomes that are used by a given voting rule. I illustrate how aggregate profiles can be used to structure proofs on properties of voting rules. Furthermore, I report on my work of implementing aggregate profiles in the theorem prover Isabelle/HOL and the connected case study of proving three established properties, anonymity, neutrality and continuity, for a subset of approval-based committee voting rules.
Literature
- "Automated Verification for Functional and Relational Properties of Voting Rules" in Sixth International Workshop on Computational Social Choice (COMSOC 2016)
- "Towards automatic argumentation about voting rules" in 4ème conférence sur les Applications Pratiques de l'Intelligence Artificielle (APIA 2018)
- "Verified Construction of Fair Voting Rules" in 29th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2019)
- "Multi-Winner Voting with Approval Preferences - Artificial Intelligence, Multiagent Systems, and Cognitive Robotics" in Springer Briefs in Intelligent Systems (2023)