Journal Papers

H. Aziz, F. Brandt, and M. Brill. On the tradeoff between economic efficiency and strategyproofness in randomized social choice. 2013. Working paper. [ pdf ]

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournaments. Social Choice and Welfare, 2013. Forthcoming. [ pdf ]

F. Brandt and M. Brill. Computing dominance-based solution concepts. 2012. Working paper. [ pdf ]

F. Brandt and M. Brill. Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. 2011. Working paper. [ pdf ]

F. Brandt, M. Brill, F. Fischer, and J. Hoffmann. The computational complexity of weak saddles. Theory of Computing Systems, 49(1):139-161, 2011. [ link | pdf ]

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. On the complexity of iterated weak dominance in constant-sum games. Theory of Computing Systems, 49(1):162-181, 2011. [ link | pdf ]

F. Brandt, M. Brill, F. Fischer, P. Harrenstein, and J. Hoffmann. Computing Shapley's saddles. ACM SIGecom Exchanges, 8(2), 2009. [ link | pdf ]

Conference Papers

H. Aziz, F. Brandt, and M. Brill. The computational complexity of random serial dictatorship. Technical report, http://arxiv.org/abs/1304.3169, 2013. [ link | pdf ]

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 Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). IFAAMAS, 2013. Forthcoming. [ pdf | venue ]

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

H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, and H. G. Seedig. Possible and necessary winners of partial tournaments. In V. Conitzer and M. Winikoff, editors, Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). IFAAMAS, 2012. [ link | pdf | venue ]

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

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

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

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

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournaments. In W. van der Hoek, G. A. Kaminka, Y. Lespérance, and M. Luck, editors, Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 47-54. IFAAMAS, 2010. [ link | pdf | venue ]

F. Brandt, M. Brill, F. Fischer, and J. Hoffmann. The computational complexity of weak saddles. In M. Mavronicolas and V. G. Papadopoulou, editors, 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 ]

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. On the complexity of iterated weak dominance in constant-sum games. In M. Mavronicolas and V. G. Papadopoulou, editors, 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 K. S. Decker, J. S. Sichman, C. Sierra, and C. Castelfranchi, editors, Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 209-216. IFAAMAS, 2009. [ link | pdf | venue ]

Thesis

Courses

WS 2012/13: Computational Social Choice

SS 2012: Economics and Computation

WS 2011/12: Computational Social Choice

SS 2011: Economics and Computation

WS 2010/11: Computational Social Choice