k-Majority digraphs and the hardness of voting with a constant number of voters
Many hardness results in computational social choice use the fact that every digraph may be induced as the pairwise majority relation of some preference profile. The standard construction requires a number of voters that is almost linear in the number of alternatives and it is unclear whether hardne...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2019
|