3 papers
cs.GT2017
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…
cs.GT2016
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving
Florian Brandl, Felix Brandt, Manuel Eberl +1
Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be man…
cs.GT2016
Optimal Bounds for the No-Show Paradox via SAT Solving
Felix Brandt, Christian Geist, Dominik Peters
Voting rules allow multiple agents to aggregate their preferences in order to reach joint decisions. Perhaps one of the most important desirable properties in this context is Condo…