Automated search for impossibility theorems in social choice theory: Ranking sets of objects C Geist, U Endriss
Journal of Artificial Intelligence Research 40, 143-174, 2011
101 2011 Finding strategyproof social choice functions via SAT solving F Brandt, C Geist
Journal of Artificial Intelligence Research 55, 565-602, 2016
66 2016 Peer review and knowledge by testimony in mathematics C Geist, B Löwe, BV Kerkhove
63 2010 Optimal bounds for the no-show paradox via SAT solving F Brandt, C Geist, D Peters
Mathematical Social Sciences 90, 18-27, 2017
54 2017 Proving the incompatibility of efficiency and strategyproofness via SMT solving F Brandl, F Brandt, M Eberl, C Geist
Journal of the ACM (JACM) 65 (2), 1-28, 2018
52 2018 Computer-aided methods for social choice theory C Geist, D Peters
Trends in Computational Social Choice, 249-267, 2017
42 2017 Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. F Brandl, F Brandt, C Geist, J Hofbauer
IJCAI, 18-24, 2015
27 2015 Analyzing the practical relevance of voting paradoxes via Ehrhart theory, computer simulations, and empirical data F Brandt, C Geist, M Strobel
Proceedings of the 2016 international conference on autonomous agents …, 2016
22 2016 A note on the McKelvey uncovered set and Pareto optimality F Brandt, C Geist, P Harrenstein
Social Choice and Welfare 46 (1), 81-91, 2016
20 2016 Pnyx:: A Powerful and User-friendly Tool for Preference Aggregation. F Brandt, G Chabin, C Geist
AAMAS, 1915-1916, 2015
18 2015 k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters G Bachmeier, F Brandt, C Geist, P Harrenstein, K Kardel, D Peters, ...
Journal of Computer and System Sciences 105, 130-157, 2019
13 2019 Strategic abstention based on preference extensions: Positive results and computer-generated impossibilities F Brandl, F Brandt, C Geist, J Hofbauer
Journal of Artificial Intelligence Research 66, 1031–1056-1031–1056, 2019
8 2019 Identifying k-majority digraphs via SAT solving F Brandt, C Geist, HG Seedig
Proceedings of the 1st AAMAS workshop on exploring beyond the worst case in …, 2014
7 2014 Analyzing the practical relevance of the Condorcet loser paradox and the agenda contraction paradox F Brandt, C Geist, M Strobel
Evaluating Voting Systems with Probability Models: Essays by and in Honor of …, 2021
5 2021 Automated search for impossibility theorems in choice theory: Ranking sets of objects C Geist
3 2010 Finding Preference Profiles of Condorcet Dimension C Geist
arXiv preprint arXiv:1402.4303, 2014
2 2014 Generating Insights in Social Choice Theory via Computer-aided Methods. C Geist
Universitätsbibliothek der TU München, 2016
1 2016 Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving FBFBC Geist
arXiv preprint arXiv:1604.05692, 2016
2016 Finding Strategyproof Social Choice Functions via SAT Solving C Geist
2014 Strategic Manipulability without Resoluteness or Shared Beliefs: Gibbard-Satterthwaite Generalized C Geist
2009 
Felix BrandtProfessor of Computer Science, Technische Universität MünchenBestätigte E-Mail-Adresse bei in.tum.de
