Software Open Access

Supplementary Material for "Analysing Irresolute Multiwinner Voting Rules with Approval Ballots via SAT Solving"

Boas Kluiving; Adriaan de Vries; Pepijn Vrijbergen; Arthur Boixel; Ulle Endriss

This is the supplementary material belonging to the paper "Analysing Irresolute Multiwinner Voting Rules with Approval Ballots via SAT Solving", published in the Proceedings of the 24th European Conference on Artificial Intelligence (ECAI-2020). In the paper, we establish various results regarding the possibility and impossibility of designing multiwinner voting rules that satisfy certain axioms. This repository contains the code used to generate the SAT instances that correspond to some of these results.

Please consult the README file for examples of how to use the system.

The paper is available at http://doi.org/10.3233/FAIA200085.

Supported by the Dutch Research Council (NWO) under project number 612.001.652 ("Customisable Collective Choice", Physical Sciences TOP-1 Grant).
Files (36.3 kB)
Name Size
config.py
md5:b23089ecaea506a767098b1f7fc019b4
782 Bytes Download
dimacser.py
md5:43a93487049d21748fd1fa910b4ab51a
862 Bytes Download
helperfunctions.py
md5:ed3d680ceab886a3b5e46be472b9adc4
9.5 kB Download
main.py
md5:f7a3de481a8c2168c349457fbb741f02
17.4 kB Download
README.md
md5:a0820020ab608e623136614b895ebc97
7.8 kB Download
  • Boas Kluiving, Adriaan de Vries, Pepijn Vrijbergen, Arthur Boixel, and Ulle Endriss. Analysing Irresolute Multiwinner Voting Rules with Approval Ballots via SAT Solving. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI-2020). IOS Press, 2020.

285
48
views
downloads
All versions This version
Views 285285
Downloads 4848
Data volume 420.8 kB420.8 kB
Unique views 256256
Unique downloads 2323

Share

Cite as