F. Brandt, M. Brill, and P. Harrenstein. Tournament solutions. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors, Handbook of Computational Social Choice, chapter 3. Cambridge University Press, 2016. [ link | pdf ]

F. Brandt, M. Brill, and P. Harrenstein. Extending tournament solutions. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pages 580–586, 2014. [ link | pdf | venue ]

H. Aziz, F. Brandt, and M. Brill. The computational complexity of random serial dictatorship. In Proceedings of the 9th International Conference on Web and Internet Economics (WINE), volume 8289 of Lecture Notes in Computer Science (LNCS), pages 24–25. Springer-Verlag, 2013. [ link | pdf | venue ]

H. Aziz, F. Brandt, and M. Brill. On the tradeoff between economic efficiency and strategyproofness in randomized social choice. In Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 455–462, 2013. [ link | pdf | venue ]

H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, and H. G. Seedig. Possible and necessary winners of partial tournaments. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 585–592, 2012. [ link | pdf | venue ]

M. Brill. Set-valued solution concepts in social choice and game theory. PhD thesis, Technische Universität München, 2012. [ link | pdf ]

M. Brill and F. Fischer. The price of neutrality for the ranked pairs method. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI), pages 1299–1305, 2012. [ pdf | venue ]

F. Brandt and M. Brill. Computing dominance-based solution concepts. In Proceedings of the 13th ACM Conference on Electronic Commerce (ACM-EC), page 233, 2012. [ link | pdf | venue ]

F. Brandt, M. Brill, and H. G. Seedig. On the fixed-parameter tractability of composition-consistent tournament solutions. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pages 85–90, 2011. [ link | pdf | venue ]

F. Brandt and M. Brill. Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), pages 136–142, 2011. [ link | pdf | venue ]

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournaments. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 47–54, 2010. [ link | pdf | venue ]

F. Brandt, M. Brill, E. Hemaspaandra, and L. Hemaspaandra. Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), pages 715–722, 2010. [ link | pdf | venue ]

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. On the complexity of iterated weak dominance in constant-sum games. In Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), volume 5814 of Lecture Notes in Computer Science (LNCS), pages 287–298. Springer-Verlag, 2009. [ link | pdf | venue ]

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Computational aspects of Shapley's saddles. In Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 209–216, 2009. [ link | pdf | venue ]

F. Brandt, M. Brill, F. Fischer, and J. Hoffmann. The computational complexity of weak saddles. In Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), volume 5814 of Lecture Notes in Computer Science (LNCS), pages 238–249. Springer-Verlag, 2009. [ link | pdf | venue ]