Prof. Dr. Felix Brandt

Associate Professor

Algorithmic Game Theory



Contact Details

Visitenkarte in TUMonline

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 is sponsored by the German Research Foundation's Heisenberg Program.


  • DFG Heisenberg-Professur (2010)
  • DFG Emmy-Noether-Stipendium (2005)

Key Publications

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; online first.


Brandt F, Harrenstein P: "Set-rationalizable choice and self-stability". Journal of Economic Theory. 2011; 146(4): 1721-1731.


Brandt F, Fischer F, and Holzer M: "Symmetries and the complexity of pure Nash equilibrium". Journal of Computer and System Sciences. 2009; 75(3): 163-177.


Brandt F, Fischer F, Harrenstein P, and Shoham Y: "Ranking games". Artificial Intelligence. 2009; 173(2): 221-239.


Brandt F, Sandholm T: "On the existence of unconditionally privacy-preserving auction protocols". ACM Transactions on Information and System Security. 2008; 11(2).