69 citations · 71 across the 2 of their papers we have counts for
5 papers
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…
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…
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…
Finding Preference Profiles of Condorcet Dimension via SAT
Christian Geist
Condorcet winning sets are a set-valued generalization of the well-known concept of a Condorcet winner. As supersets of Condorcet winning sets are always Condorcet winning sets the…
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
Christian Geist, Ulle Endriss
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of…