Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

TL;DR

This thesis explores computational social choice, focusing on fundamental problems at the intersection of algorithms and social choice theory, aiming to address their inherent complexity.

Contribution

It provides new insights and methods to resolve the complexity of key problems in computational social choice.

Findings

Identified complexity barriers in social choice problems

Developed algorithms to address specific computational challenges

Proposed theoretical frameworks for problem resolution

Abstract

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