Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
Data Structures and Algorithms
2017-03-24 v1 Artificial Intelligence
Multiagent Systems
Abstract
This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.
Keywords
Cite
@article{arxiv.1703.08041,
title = {Resolving the Complexity of Some Fundamental Problems in Computational Social Choice},
author = {Palash Dey},
journal= {arXiv preprint arXiv:1703.08041},
year = {2017}
}
Comments
Ph.D. Thesis