It only takes a few: On the Hardness of voting with a constant number of agents
Many hardness results in computational social choice make use of the fact that every directed graph may be induced by the pairwise majority relation. However, this fact requires that the number of voters is almost linear in the number of alternatives. It is therefore unclear whether existing hardnes...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
International Foundation for Autonomous Agents and Multiagent Systems
2013
|