k-Majority digraphs and the hardness of voting with a constant number of voters

2019/05/09 by Georg Bachmeier, Felix Brandt, Christian Geist +4 · 2 citations
Economics, Econometrics and Finance · Decision Sciences · Business, Management and Accounting · #Game Theory and Voting Systems #Game Theory and Applications #Consumer Market Behavior and Pricing

paper · doi:10.1016/j.jcss.2019.04.005

Cited by

• Kemeny Rank Aggregation is NP-Hard for Three Voters
• Tournaments determined by three and five voters