Published May 30, 2023
| Version v1
Lesson
Open
Tutorial on Automated Reasoning for Social Choice Theory
Description
This tutorial provides a hands-on introduction to the use of automated reasoning tools in the field of computational social choice. The focus is on using SAT solvers to prove impossibility theorems in voting theory.
It was first delivered at the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS) in London in May 2023, and later also at the 26th European Conference on Artificial Intelligence (ECAI) in Kraków in September 2023 and the 33rd International Joint Conference on Artificial Intelligence (IJCAI) on Jeju Island in August 2024.
This repository includes a slide deck and a Jupyter Notebook with code written in Python (using the PySAT library).
Files
sat4sct.ipynb
Files
(449.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:dd0762a77c06535f9241830284b1a2a0
|
390.7 kB | Preview Download |
|
md5:2aeeacb4e6d9acbb58e50c9ca5be9093
|
58.5 kB | Preview Download |