Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

Abstract
This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.
View on arXivComments on this paper