k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters

Georg Bachmeier, Felix Brandt, Christian Geist +4

Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. How…