Book Chapters

M. Brill. Interactive Democracy: New Challenges for Social Choice Theory. In J.-F. Laslier, H. Moulin, R. Sanver, and W. S. Zwicker, editors, Future of Economic Design, Series Studies in Economic Design, Springer, 2019. Forthcoming. 

F. Brandt, M. Brill, and P. Harrenstein. Tournament Solutions. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. Procaccia, editors, Handbook of Computational Social Choice. Cambridge University Press, 2016. [ amazonpdf (whole book) ]

M. Brill. Mengenwertige Lösungskonzepte in Spieltheorie und Social-Choice-Theorie. In S. Hölldobler et al., editors, Ausgezeichnete Informatikdissertationen 2012, volume D-13 of GI-Edition Lecture Notes in Informatics (LNI), pages 41–50. Gesellschaft für Informatik e.V. (GI), 2013. [ linkpdf (whole book) ]


Journal Papers

M. Brill, T. Fluschnik, V. Froese, B. J. Jain, R. Niedermeier, D. Schultz. Exact Mean Computation in Dynamic Time Warping Spaces. Data Mining and Knowledge Discovery, 33(1):252-291, 2019. [ link

H. Aziz, F. Brandl, F. Brandt, and M. Brill. On the tradeoff between efficiency and strategyproofness. Games and Economic Behavior, 110:1-18, 2018. [ linkpdf ]

M. Brill, J.-F. Laslier, and P. Skowron. Multiwinner Approval Rules as Apportionment Methods. Journal of Theoretical Politics, 30(3):358-382, 2018. [ link | pdf ]

F. Brandt, M. Brill, and P. Harrenstein. Extending tournament solutions. Social Choice and Welfare, 51(2):193-222, 2018. [ linkpdf ]

F. Brandt, M. Brill, H. G. Seedig, and W. Suksompong. On the structure of stable tournament solutionsEconomic Theory, 65(2):483-507, 2018. [ link | pdf ]

H. Aziz, M. Brill, V. Conitzer, E. Elkind, R. Freeman, and T. Walsh. Justified Representation in Approval-Based Committee Voting. Social Choice and Welfare, 48(2):461-485, 2017. [ link | pdf ]

F. Brandt and M. Brill. Computing dominance-based solution concepts. ACM Transactions on Economics and Computation (TEAC), Volume 5, Issue 2, Article 9, 2016. [ linkpdf ]

F. Brandt, M. Brill, and W. Suksompong. An Ordinal Minimax Theorem. Games and Economic Behavior, 95:107-112, 2016. [ linkpdf ]

H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, and H. G. Seedig. Possible and necessary winners of partial tournamentsJournal of Artificial Intelligence Research, 54:493-534, 2015. [ link | pdf ]

F. Brandt, M. Brill, E. Hemaspaandra, and L. Hemaspaandra. Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electoratesJournal of Artificial Intelligence Research, 53:439-496, 2015. [ link | pdf ]

H. Aziz, F. Brandt, M. Brill, and J. Mestre. Computational aspects of random serial dictatorshipACM SIGecom Exchanges, 13(2):26-30, 2014. [ link | pdf ]

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournamentsSocial Choice and Welfare, 42(3):551–574, 2014. [ link | pdf ]

H. Aziz, M. Brill, and P. Harrenstein. Testing substitutability of weak preferencesMathematical Social Sciences, 66(1):91-94, 2013. [ link ]

H. Aziz, F. Brandt, and M. Brill. The computational complexity of random serial dictatorshipEconomics Letters, 121(3):341–345, 2013. [ link | pdf ]

F. Brandt, M. Brill, F. Fischer, and J. Hoffmann. The computational complexity of weak saddlesTheory 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 gamesTheory of Computing Systems, 49(1):162-181, 2011. [ link | pdf ]

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


Conference Papers

M. Brill, P. Faliszewski, F. Sommer, and N. Talmon. Approximation Algorithms for BalancedCC Multiwinner Rules. In Proceedings of the 18th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS). IFAAMAS, 2019. [ linkvenue 

M. Brill. Interactive Democracy. In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) Blue Sky Ideas Track. IFAAMAS (www.ifaamas.org), 2018.       [ linkpdf | venue ]

M. Brill and N. Talmon. Pairwise Liquid Democracy. In Proceedings of the the 27th International Joint Conference on Artificial Intelligence (IJCAI), 2018.  [ linkpdf | venue ]

M. Brill, T. Fluschnik, V. Froese, B. J. Jain, R. Niedermeier, D. Schultz. Exact Mean Computation in Dynamic Time Warping Spaces. In Proceedings of the 18th SIAM International Conference on Data Mining (SDM), 2018. [ pdfarXiv | venue ]  [also presented at the 3rd Highlights of Algorithms conference (HALG 2018)]

P. Skowron, M. Lackner, M. Brill, D. Peters, E. Elkind. Proportional Rankings. In C. Sierra, editor, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), 2017.                   [ pdfarXiv ]

M. Brill, R. Freeman, S. Janson, and M. Lackner. Phragmén's Voting Methods and Justified RepresentationIn S. Singh and S. Markovitch, editors, Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI), AAAI Press, 2017. [ linkpdf | venue ]  

M. Brill, J.-F. Laslier, and P. Skowron. Multiwinner Approval Rules as Apportionment Methods. In S. Singh and S. Markovitch, editors, Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI), AAAI Press, 2017. [ linkpdf | arXiv | venue ]

M. Brill, E. Elkind, U. Endriss, and U. Grandi. Pairwise Diffusion of Preference Rankings in Social Networks. In S. Kambhampati, editor, Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), 2016.  [ linkpdf | venue ]

M. Brill, V. Conitzer, R. Freeman, and N. Shah. False-Name-Proof Recommendations in Social NetworksIn Proceedings of the 15th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS). IFAAMAS, 2016. [ pdf | venue 

M. Brill, R. Freeman, and V. Conitzer. Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, 2016. [ pdfvenue ]

V. Conitzer, R. Freeman, M. Brill, and Y. Li. Rules for Choosing Societal Tradeoffs. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, 2016. [ pdfvenue ]

V. Conitzer, M. Brill, and R. Freeman.  Crowdsourcing Societal Tradeoffs. In Proceedings of the 14th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS) Blue Sky Ideas track. IFAAMAS, 2015. [ pdf | venue ]

R. Freeman, M. Brill, and V. Conitzer. General Tiebreaking Schemes for Computational Social Choice. In Proceedings of the 14th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS). IFAAMAS, 2015.pdf | venue ]

H. Aziz, M. Brill, V. Conitzer, E. Elkind, R. Freeman, and T. Walsh. Justified Representation in Approval-Based Committee Voting. In B. Bonet, S. Koenig, editors, Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, 2015. [ linkpdf | venue ]

M. Brill and V. Conitzer. Strategic Voting and Strategic Candidacy. In B. Bonet, S. Koenig, editors, Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, 2015. [ linkpdf | venue ]

R. Freeman, M. Brill, and V. Conitzer. On the Axiomatic Characterization of Runoff Voting Rules. In C. E. Brodley and P. Stone, editors, Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, 2014. [ pdf | venue ]

F. Brandt, M. Brill, and P. Harrenstein. Extending tournament solutions. In C. E. Brodley and P. Stone, editors, Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, 2014. [ linkpdf | venue ]

H. Aziz, F. Brandt, and M. Brill. The computational complexity of random serial dictatorship. In Y. Chen and N. Immorlica, editors,Proceedings of the 9th Conference on Web and Internet Economics (WINE), Lecture Notes in Computer Science (LNCS). Springer-Verlag, 2013. [ 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 Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 455-462. IFAAMAS, 2013. [ 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 ]


Working papers

S. Brams and M. Brill. The Excess Method: A Multiwinner Approval Voting Procedure to Allocate Wasted Votes. Working paper, 2019.  

L. Sánchez-Fernández, N. Fernández García, J. A. Fisteus, and M. Brill. The Maximin Support Method: An Extension of the D’Hondt Method to Approval-Based Multiwinner Elections. Working paper, 2018. [ arXiv ] 


Thesis

M. Brill. Set-valued solution concepts in social choice and game theory: Axiomatic and computational aspects. PhD thesis, Technische Universität München, 2012. [ linkpdf ]