Computational Complexity of Fundamental Problems in Social Choice Theory

Computational social choice (comsoc) theory is currently an important area of research in computer science and more specifically in AI. The field started with the pioneering work of Bartholdi et al. in 1989 where they explored the the possibility of using computational intractability as a barrier against manipulation. Following that, a vast amount of research explored computational complexity of various problems in the context of social choice theory. We, in this thesis, study some of the fundamental problems in this domain. Manipulation of voting rules is a well known phenomena is social choice theory. Till date, researchers have studied a plenty of ways to make manipulation either impossible or computationally intractable. Yet, there are not a single satisfactory solution to prevent manipulation. In such a scenario where prevention fails even after considerable research effort of more than four decades, a natural research direction is to explore detection of manipulation. This is...

• Type: Journal
• Year: 2015
• Where: ATAL
• Authors: Palash Dey
• Keywords: ATAL 2015, Intelligent Agents