Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

23 Mar 2017 · Palash Dey ·

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

Code

Add Remove Mark official

No code implementations yet. Submit your code now

Add Datasets introduced or used in this paper

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

No methods listed for this paper. Add relevant methods here