Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

03/23/2017
by   Palash Dey, et al.
0

This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/30/2017

Computational Social Choice and Computational Complexity: BFFs?

We discuss the connection between computational social choice (comsoc) a...
03/20/2018

Collective Schedules: Scheduling Meets Computational Social Choice

When scheduling public works or events in a shared facility one needs to...
04/09/2018

Balancedness of Social Choice Correspondences

A social choice correspondence satisfies balancedness if, for every pair...
02/15/2019

On the computational models for the analysis of illicit activities

This paper presents a study on the advancement of computational models f...
03/15/2022

Social Choice Around the Block: On the Computational Social Choice of Blockchain

One of the most innovative aspects of blockchain technology consists in ...
07/15/2021

Combatting Gerrymandering with Social Choice: the Design of Multi-member Districts

Every representative democracy must specify a mechanism under which vote...
05/10/2018

Computational Social Choice Meets Databases

We develop a novel framework that aims to create bridges between the com...