Papers
Topics
Authors
Recent
Search
2000 character limit reached

Resolving the Complexity of Some Fundamental Problems in Computational Social Choice

Published 23 Mar 2017 in cs.DS, cs.AI, and cs.MA | (1703.08041v1)

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

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.