 |
|
Dr. Christian GeistAlumnus of:
Institut für Informatik (I18) Technische Universität München
|
in.tum.deSelected Posters
Pnyx: a Tool for Preference Aggregation (May 2015)
k-Majority Digraphs (Jun 2014)
Finding Strategyproof SCFs via SAT Solving (May 2014)
Announcements
- A public beta version of Pnyx - our powerful & user-friendly tool for preference aggregation - is online at pnyx.dss.in.tum.de
Short Bio
- 2013 - 2016: AGT Group (Prof. Dr. Felix Brandt), Technische Universität München, Germany
- 2010 - 2012: Consultant at McKinsey & Company, Inc., Munich, Germany
- 2008 - 2010: M.Sc. in Logic, Institute for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, Netherlands
- 2004 - 2008: B.Sc. in Mathematics with Computer Science, Technische Universität Darmstadt, Germany
- 2007: Semester Study Abroad Programme, University of Cape Town, South Africa
Publications
F. Brandl, F. Brandt, C. Geist, and J. Hofbauer. Strategic abstention based on preference extensions: Positive results and computer-generated impossibilities. Journal of Artificial Intelligence Research, 2019. Forthcoming. [ pdf ] G. Bachmeier, F. Brandt, C. Geist, P. Harrenstein, K. Kardel, D. Peters, and H. G. Seedig. k-majority digraphs and the hardness of voting with a constant number of voters. Journal of Computer and System Sciences, 2019. Forthcoming. [ link | pdf ] F. Brandl, F. Brandt, M. Eberl, and C. Geist. Proving the incompatibility of efficiency and strategyproofness via SMT solving. Journal of the ACM, 65(2), 2018. [ link | pdf ] F. Brandt, C. Geist, and D. Peters. Optimal bounds for the no-show paradox via SAT solving. Mathematical Social Sciences, 90:18–27, 2017. Special Issue in Honor of Hervé Moulin. [ link | pdf ] F. Brandl, F. Brandt, and C. Geist. Proving the incompatibility of efficiency and strategyproofness via SMT solving. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pages 116–122. AAAI Press, 2016. [ link | pdf | venue ] F. Brandt, C. Geist, and M. Strobel. Analyzing the practical relevance of voting paradoxes via Ehrhart theory, computer simulations, and empirical data. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 385–393. IFAAMAS, 2016. [ link | pdf | venue ] F. Brandt, C. Geist, and D. Peters. Optimal bounds for the no-show paradox via SAT solving. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 314–322. IFAAMAS, 2016. [ link | pdf | venue ] F. Brandt and C. Geist. Finding strategyproof social choice functions via SAT solving. Journal of Artificial Intelligence Research, 55:565–602, 2016. [ link | pdf ] C. Geist. Generating insights in social choice theory via computer-aided methods. PhD thesis, Technische Universität München, 2016. [ link | pdf ] F. Brandt, C. Geist, and P. Harrenstein. A note on the McKelvey uncovered set and Pareto optimality. Social Choice and Welfare, 46(1):81–91, 2016. [ link | pdf ] F. Brandl, F. Brandt, C. Geist, and J. Hofbauer. Strategic abstention based on preference extensions: Positive results and computer-generated impossibilities. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pages 18–24. AAAI Press, 2015. [ link | pdf | venue ] F. Brandt, G. Chabin, and C. Geist. Pnyx: A powerful and user-friendly tool for preference aggregation. In Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1915–1916. IFAAMAS, 2015. [ link | pdf | venue ] F. Brandt, C. Geist, and H. G. Seedig. Identifying k-majority digraphs via SAT solving. In Proceedings of the 1st AAMAS Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE), 2014. [ link | pdf | venue ] C. Geist. Finding preference profiles of Condorcet dimension k via SAT. Technical report, http://arxiv.org/abs/1402.4303, 2014. [ link | pdf ] F. Brandt and C. Geist. Finding strategyproof social choice functions via SAT solving. In Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1193–1200. IFAAMAS, 2014. [ link | pdf | venue ] C. Geist and U. Endriss. Automated search for impossibility theorems in social choice theory: Ranking sets of objects. Journal of Artificial Intelligence Research, 40:143–174, 2011. [ link ] C. Geist, B. Löwe, and B. van Kerkhove. Peer review and knowledge by testimony in mathematics. In B. Löwe and T. Müller, editors, PhiMSAMP. Philosophy of Mathematics: Sociological Aspects and Mathematical Practice, Texts in Philosophy 11, pages 155–178. College Publications, London, 2010. [ link ] C. Geist. Automated search for impossibility theorems in choice theory: Ranking sets of objects. Master's thesis, Universiteit van Amsterdam, 2010. [ link | pdf ]
Presented Talks
- Participation and Strategyproofness: Insights via SAT Solving (Dagstuhl Seminar on Computational Social Choice: Theory and Applications, Dagstuhl, Germany, 06/2015)
- Open Problems: Identifying k-Majority Digraphs (Dagstuhl Seminar on Computational Social Choice: Theory and Applications, Dagstuhl, Germany, 06/2015)
- Pnyx: A Powerful and User-friendly Tool for Preference Aggregation (Demonstration) (14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Istanbul, Turkey, 05/2015)
- Gaining Insights in Social Choice via Computer-aided Methods (Workshop on Challenges in Algorithmic Social Choice, Bad Belzig, Germany, 10/2014)
- Finding Strategyproof Social Choice Functions via SAT Solving (5th International Workshop on Computational Social Choice (COMSOC), Pittsburgh, PA, USA, 06/2014)
- On the Equivalence of the McKelvey Uncovered Set and the Pareto Set (12th Meeting of the Society for Social Choice and Welfare (SSCW), Boston, MA, USA, 06/2014)
- Finding Strategyproof Social Choice Functions via SAT Solving (13th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Paris, France, 05/2014)
- Identifying k-Majority Digraphs via SAT Solving (1st Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE), Paris, France, 05/2014)
- Finding Strategyproof Social Choice Functions via SAT Solving (Maastricht Meeting, COST Action IC1205, Maastricht, Netherlands, 04/2014)
- Finding Strategyproof Social Choice Functions via SAT Solving (Computational Social Choice Seminar, Institute for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, Netherlands, 10/2013)
- Automated Theorem Proving for Impossibility Theorems Regarding Ranking Sets of Objects (International Doctoral School on Computational Social Choice, European Cooperation in the field of Scientific and Technical Research, Estoril, Portugal, 04/2010)
- Computer-Aided Proofs for Impossibility Theorems in Social Choice Theory (Seminar of the Laboratory of Foundational Aspects of Computer Science, University of Cape Town, South Africa, 02/2010)
Teaching
Courses
- Seminar on Computational Social Choice (WS 2015/16)
- Economics and Computation (SS 2015)
- Computational Social Choice (WS 2014/15)
- Economics and Computation (SS 2014)
- Computational Social Choice (WS 2013/14)
- Economics and Computation (SS 2013)
Student projects
- Master's thesis A Quantitative Study of the Axiomatic Properties of Selected Voting Rules (Martin Strobel, 2015)
- IDP Pnyx: A Tool for Preference Aggregation (Guillaume Chabin, 2014)
- Bachelor's thesis Answer Set Programming for Computer-aided Theorem Proving in Social Choice Theory (Michael Bay, 2013/14)
- Master's thesis Constraint Satisfaction Programming for Computer-aided Theorem Proving in Social Choice Theory (Elisabeth Brändle, 2013)
Community Service
Refereeing Journals
Refereeing Conferences