Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
arXiv:1703.08041v1
AI Analysis
It tackles complexity issues in computational social choice, which is an intersection of algorithms and social choice theory, but appears incremental as it builds on existing foundational work.
The thesis addresses fundamental problems in computational social choice, aiming to resolve their complexity, but no specific results or numbers are provided.
This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.