Page Content
to Navigation
Journal Papers
M. Brill and T. Fluschnik and V. Froese and B. Jain and R. Niedermeier and D. Schultz. Exact mean computation in dynamic time warping spaces. Data Mining and Knowledge Discovery, 33(1):252–291, 2019. |
F. Brandt and M. Brill and P. Harrenstein. Extending Tournament Solutions. Social Choice and Welfare, 51(2):193–222, 2018. |
M. Brill and J.-F. Laslier and P. Skowron. Multiwinner Approval Rules as Apportionment Methods. Journal of Theoretical Politics, 30(3):358–382, 2018. |
F. Brandt and M. Brill and H. G. Seedig and W. Suksompong. On the structure of stable tournament solutions. Economic Theory, 65(2):483–507, 2018. |
H. Aziz and F. Brandl and F. Brandt and M. Brill. On the Tradeoff between Efficiency and Strategyproofness. Games and Economic Behavior, 110:1–18, 2018. |
H. Aziz and M. Brill and V. Conitzer and E. Elkind and R. Freeman and T. Walsh. Justified Representation in Approval-Based Committee Voting. Social Choice and Welfare, 48(2):461–485, 2017. |
F. Brandt and M. Brill and W. Suksompong. An Ordinal Minimax Theorem. Games and Economic Behavior, 95:107–112, 2016. |
F. Brandt and M. Brill. Computing Dominance-Based Solution Concepts. ACM Transactions on Economics and Computation, 2016. |
H. Aziz and F. Brandt and M. Brill and J. Mestre. Computational Aspects of Random Serial Dictatorship. ACM SIGecom Exchanges, 13(2):26–30, 2014. |
F. Brandt and M. Brill and F. Fischer and P. Harrenstein. Minimal Retentive Sets in Tournaments. Social Choice and Welfare, 42(3):551–574, 2014. |
H. Aziz and M. Brill and P. Harrenstein. Testing substitutability of weak preferences. Mathematical Social Sciences, 66(1):91–94, 2013. |
H. Aziz and F. Brandt and M. Brill. The Computational Complexity of Random Serial Dictatorship. Economics Letters, 121(3):341–345, 2013. |
F. Brandt and M. Brill and F. Fischer and J. Hoffmann. The Computational Complexity of Weak Saddles. Theory of Computing Systems, 49(1):139–161, 2011. Special Issue on Algorithmic Game Theory |
F. Brandt and M. Brill and F. Fischer and P. Harrenstein and J. Hoffmann. Computing Shapley's Saddles. ACM SIGecom Exchanges, 2009. |
Conference Papers
M. Brill. Interactive Democracy. In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) Blue Sky Ideas track, pages 1183–1187. IFAAMAS, 2018. |
M. Brill and N. Talmon. Pairwise Liquid Democracy. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pages 137–143. IJCAI, 2018. |
M. Brill and V. Conitzer. Strategic Voting and Strategic Candidacy. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), pages 819–826. AAAI Press, 2015. |
F. Brandt and M. Brill and P. Harrenstein. Extending Tournament Solutions. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pages 580–586. AAAI Press, 2014. |
F. Brandt and M. Brill. Computing Dominance-Based Solution Concepts. In Proceedings of the 13th ACM Conference on Electronic Commerce (ACM-EC), pages 233. ACM Press, 2012. |
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. AAAI Press, 2012. |
Thesis
M. Brill. Set-Valued Solution Concepts in Social Choice and Game Theory. Technische Universität München, 2012. |