F. Brandt and C. Dong. On locally rationalizable social choice functions. Theory and Decision, 2025. Forthcoming. [ link | pdf ] F. Brandt and F. Grundbacher. The Banks set and the bipartisan set may be disjoint. 2024. Working paper. [ pdf ] F. Brandt and P. Lederer. Characterizing the top cycle via strategyproofness. Theoretical Economics, 18(2):837–883, 2023. [ link | 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, 105:130–157, 2019. [ link | pdf ] F. Brandt, M. Brill, H. G. Seedig, and W. Suksompong. On the structure of stable tournament solutions. Economic Theory, 65(2):483–507, 2018. [ link | pdf ] F. Brandt, M. Brill, and P. Harrenstein. Extending tournament solutions. Social Choice and Welfare, 51(2):193–222, 2018. [ link | pdf ] F. Brandt, P. Harrenstein, and H. G. Seedig. Minimal extending sets in tournaments. Mathematical Social Sciences, 87:55–63, 2017. [ link | pdf ] F. Brandt and C. Geist. Finding strategyproof social choice functions via SAT solving. Journal of Artificial Intelligence Research, 55:565–602, 2016. [ link | pdf ] F. Brandt and H. G. Seedig. On the discriminative power of tournament solutions. In Selected Papers of the International Conference on Operations Research, OR2014, Operations Research Proceedings, pages 53–58. Springer-Verlag, 2016. [ link | pdf | venue ] 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, 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. Brandt, A. Dau, and H. G. Seedig. Bounds on the disparity and separation of tournament solutions. Discrete Applied Mathematics, 187:41–49, 2015. [ link | pdf ] F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournaments. Social Choice and Welfare, 42(3):551–574, 2014. [ link | pdf ] D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe. The complexity of computing minimal unidirectional covering sets. Theory of Computing Systems, 53(3):467–502, 2013. [ link | pdf ] F. Brandt, M. Chudnovsky, I. Kim, G. Liu, S. Norin, A. Scott, P. Seymour, and S. Thomassé. A counterexample to a conjecture of Schwartz. Social Choice and Welfare, 40(3):739–743, 2013. [ link | pdf ] 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. Minimal stable sets in tournaments. Journal of Economic Theory, 146(4):1481–1499, 2011. [ link | pdf ] F. Brandt, F. Fischer, P. Harrenstein, and M. Mair. A computational analysis of the tournament equilibrium set. Social Choice and Welfare, 34(4):597–609, 2010. [ link | pdf ] F. Brandt and P. Harrenstein. Characterization of dominance relations in finite coalitional games. Theory and Decision, 69(2):233–256, 2010. [ link | pdf ] F. Brandt. Tournament solutions – Extensions of maximality and their applications to decision-making. Habilitation Thesis, Faculty for Mathematics, Computer Science, and Statistics, University of Munich, 2009. [ pdf ] F. Brandt, F. Fischer, and P. Harrenstein. The computational complexity of choice sets. Mathematical Logic Quarterly, 55(4):444–459, 2009. Special Issue on Computational Social Choice. [ link | pdf ] F. Brandt and F. Fischer. Computing the minimal covering set. Mathematical Social Sciences, 56(2):254–268, 2008. [ link | pdf ] F. Brandt. Minimal stable sets in tournaments. Technical report, https://arxiv.org/abs/0803.2138, 2008. [ link | pdf ] F. Brandt and F. Fischer. PageRank as a weak tournament solution. In Proceedings of the 3rd International Workshop on Internet and Network Economics (WINE), volume 4858 of Lecture Notes in Computer Science (LNCS), pages 300–305. Springer-Verlag, 2007. [ link | pdf | venue ]
