Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects. - Christian Geist; Ulrich Endriss (J. Artif. Intell. Res., 2011)

Finding Preference Profiles of Condorcet Dimension $k$ via SAT. - Christian Geist (CoRR, 2014)

Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation. - Felix Brandt 001; Guillaume Chabin; Christian Geist (AAMAS, 2015)

Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data. - Felix Brandt 001; Christian Geist; Martin Strobel 001 (AAMAS, 2016)

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. - Florian Brandl; Felix Brandt 001; Christian Geist (IJCAI, 2016)

Finding Strategyproof Social Choice Functions via SAT Solving. - Felix Brandt 001; Christian Geist (J. Artif. Intell. Res., 2016)

A note on the McKelvey uncovered set and Pareto optimality. - Felix Brandt 001; Christian Geist; Paul Harrenstein (Soc. Choice Welf., 2016)

Generating Insights in Social Choice Theory via Computer-aided Methods. - Christian Geist (2016)

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (CoRR, 2017)

Optimal bounds for the no-show paradox via SAT solving. - Felix Brandt 001; Christian Geist; Dominik Peters (Math. Soc. Sci., 2017)

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. - Florian Brandl; Felix Brandt 001; Manuel Eberl; Christian Geist (J. ACM, 2018)

Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. - Florian Brandl; Felix Brandt 001; Christian Geist; Johannes Hofbauer (J. Artif. Intell. Res., 2019)

k-Majority digraphs and the hardness of voting with a constant number of voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (J. Comput. Syst. Sci., 2019)