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 | 102 | 2011 |
Peer review and knowledge by testimony in mathematics C Geist, B Löwe, BV Kerkhove | 71 | 2010 |
Optimal bounds for the no-show paradox via SAT solving F Brandt, C Geist, D Peters Mathematical Social Sciences 90, 18-27, 2017 | 67 | 2017 |
Finding strategyproof social choice functions via SAT solving F Brandt, C Geist Journal of Artificial Intelligence Research 55, 565-602, 2016 | 66 | 2016 |
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 | 57 | 2018 |
Computer-aided methods for social choice theory C Geist, D Peters Trends in Computational Social Choice, 249-267, 2017 | 47 | 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 | 28 | 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 | 25 | 2016 |
Pnyx:: A Powerful and User-friendly Tool for Preference Aggregation. F Brandt, G Chabin, C Geist AAMAS, 1915-1916, 2015 | 21 | 2015 |
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 |
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 | 17 | 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 | 9 | 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 | 8 | 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 | 7 | 2021 |
Generating Insights in Social Choice Theory via Computer-aided Methods C Geist Technische Universität München, 2016 | 3 | 2016 |
Finding Preference Profiles of Condorcet Dimension via SAT C Geist arXiv preprint arXiv:1402.4303, 2014 | 3 | 2014 |
Automated search for impossibility theorems in choice theory: Ranking sets of objects C Geist | 3 | 2010 |
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving FBFBC Geist arXiv preprint arXiv:1604.05692, 2016 | | 2016 |
3.17 Open Problems: Identifying k-majority Digraphs C Geist Computational Social Choice: Theory and Applications, 14, 2016 | | 2016 |
3.16 Participation and Strategyproofness: Insights via SAT Solving C Geist Computational Social Choice: Theory and Applications, 13, 2016 | | 2016 |