Lecture Notes on Voting Theory

05/01/2021
by   Davide Grossi, et al.
0

These lecture notes have been developed for the course Computational Social Choice of the Artificial Intelligence MSc programme at the University of Groningen. They cover mathematical and algorithmic aspects of voting theory.

READ FULL TEXT

page 14

page 16

page 26

page 31

page 32

page 36

research
01/10/2020

Notes on Theory of Distributed Systems

Notes for the Yale course CPSC 465/565 Theory of Distributed Systems....
research
09/02/2022

Category Theory for Programming

In these lecture notes, we give a brief introduction to some elements of...
research
01/02/2018

Complexity Theory, Game Theory, and Economics

This document collects the lecture notes from my mini-course "Complexity...
research
10/13/2021

An algorithm for a fairer and better voting system

The major finding, of this article, is an ensemble method, but more exac...
research
07/25/2023

A Guide to Krivine Realizability for Set Theory

The method of realizability was first developed by Kleene and is seen as...
research
01/02/2023

Algorithms for Massive Data – Lecture Notes

These are the lecture notes for the course CM0622 - Algorithms for Massi...
research
06/11/2018

Lecture Notes on Fair Division

Fair division is the problem of dividing one or several goods amongst tw...

Please sign up or login with your details

Forgot password? Click here to reset