Academic Career and Research Areas
Prof. Brandt (b. 1973) studies the mathematical and complexity-theoretic foundations of the interaction of autonomous agents. His main fields of interest are algorithmic game theory and computational social choice, which lie at the intersection of theoretical computer science, artificial intelligence, and economics.
After studying computer science and mathematics at TUM, Prof. Brandt received his doctorate in 2003. His thesis dealt with electronic auctions and was supervised by Prof. W. Brauer. He then spent a year as a postdoctoral fellow at Carnegie Mellon University and a year at Stanford University in the USA. He qualified as a lecturer in 2010 at Munich’s Ludwig Maximilians University (LMU). His professorship was sponsored by the German Research Foundation's Heisenberg Program. Since 2012, he has a secondary appointment in the Department of Mathematics.
- DFG Reinhart-Koselleck-Project (2017)
- DFG Heisenberg-Professorship (2010)
- DFG Emmy-Noether-Grant (2005)
Brandl F, Brandt F, Eberl M, Geist C: "Proving the incompatibility of efficiency and strategyproofness via SMT solving". Journal of the ACM. 2018; 65(2): Article No. 6.Abstract
Brandl F, Brandt F, Seedig HG: "Consistent probabilistic social choice". Econometrica. 2016; 84(5): 1839-1880.Abstract
Brandt F, Chudnovsky M, Kim I, Liu G, Norin S, Scott A, Seymour P, Thomassé S: "A counterexample to a conjecture of Schwartz". Social Choice and Welfare. 2012; 40(3): 739-743.Abstract
Brandt F, Harrenstein P: "Set-rationalizable choice and self-stability". Journal of Economic Theory. 2011; 146(4): 1721-1731.Abstract
Brandt F, Fischer F, Harrenstein P, Shoham Y: "Ranking games". Artificial Intelligence. 2009; 173(2): 221-239.Abstract