Verified construction of fair voting rules

DOI10.1007/978-3-030-45260-5_6zbMATH Open1504.91095OpenAlexW3019201640MaRDI QIDQ5097629FDOQ5097629

Authors: Karsten Diekhoff, Michael Kirsten, Jonas Krämer 

Publication date: 25 August 2022

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000120007

Recommendations

• Combining voting rules together
• Properties of multiwinner voting rules
• Schulze voting as evidence carrying computation
• Monotonicity of single-seat preferential election rules
• Analysing irresolute multiwinner voting rules with approval ballots via SAT solving

zbMATH Keywords

social choicehigher-order logicmodular verification

Mathematics Subject Classification ID

Social choice (91B14) Specification and verification (program logics, model checking, etc.) (68Q60) Voting theory (91B12) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Democratix: a declarative approach to winner determination
• Social choice and individual values
• Isabelle/HOL. A proof assistant for higher-order logic
• Handbook of Computational Social Choice
• Evaluation and Optimization of Electoral Systems
• Combining voting rules together
• Analysing vote counting algorithms via logic. And its application to the CADE election scheme

Cited In (1)

• Equitable agendas: Agendas ensuring identical sincere and sophisticated voting decisions

Uses Software

• Isabelle/HOL
• Democratix

This page was built for publication: Verified construction of fair voting rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097629)