Hello, I'm Dominik. I'm a postdoctoral researcher hosted by Ariel Procaccia at Harvard University.
I work on computational social choice, studying voting rules and preference aggregation, and designing fair algorithms. Recently, I have been interested in how organisations can decide how to divide their budgets among competing projects. I also enjoy proving impossibility theorems in voting theory using computer-aided methods involving SAT solvers.
I was previously a postdoc at CMU's Computer Science Department (2019–20). I did my PhD (DPhil, 2015–19) at the Department of Computer Science, University of Oxford, supervised by Edith Elkind, as a member of Balliol College. Previously (2011–15), I was an undergraduate student of Maths & Computer Science at St. John's College, Oxford. I'm originally from Barsbüttel, close to Hamburg.
Updated: 2021-01-06 News. I have moved from CMU to Harvard. While we're all working remotely, I've decided to do some travelling, so you won't find me in Cambridge, MA, for now. Currently, I'm in Orlando, Florida. We have a new working paper out that introduces an attractive voting rule for participatory budgeting; I recommend reading the extended introduction.
My talk at 
🖥 Check out the COMSOC Video Seminar, which I'm co-organising.
new! Find small pieces of code for voting rules and fair division on GitHub Gist.
🖱 new! Try out demos of portioning mechanisms and of moving phantom mechanisms.
Thesis 🎓
- Fair Division of the Commons.
Dominik Peters. DPhil in Computer Science, University of Oxford, September 2019, 200 pages.
PDF · Talk · Victor Lesser Distinguished Dissertation Award · EurAI Distinguished Dissertation Award
Preprints
- Proportional Participatory Budgeting with Cardinal Utilities.
Dominik Peters, Grzegorz Pierczyński, and Piotr Skowron. Working Paper, August 2020.
PDF · arXiv - Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results.
Dominik Peters, Lan Yu, Hau Chan, and Edith Elkind. Draft of journal version, July 2020.
PDF · arXiv - Funding Public Projects: A Case for the Nash Product Rule.
Felix Brandt, Florian Brandl, Dominik Peters, Christian Stricker, Warut Suksompong. Working Paper, March 2020.
PDF · arXiv - Simple Characterizations of Approval Voting.
Florian Brandl and Dominik Peters. July 2019.
PDF
2020+
- Preferences Single-Peaked on a Circle.
Dominik Peters and Martin Lackner. In Journal of Artificial Intelligence Research, 68:463–502, 2020.
PDF · Journal - Preference Elicitation as Average-Case Sorting.
Dominik Peters and Ariel D. Procaccia. In AAAI '21 (accepted).
PDF - Market-Based Explanations of Collective Decisions.
Dominik Peters, Grzegorz Pierczyński, Nisarg Shah, and Piotr Skowron. In AAAI '21 (accepted).
PDF - Aggregating Binary Judgments Ranked By Accuracy.
Daniel Halpern, Greg Kehne, Dominik Peters, Ariel D. Procaccia, Nisarg Shah, and Piotr Skowron. In AAAI '21 (accepted).
PDF - District-Fair Participatory Budgeting.
D. Ellis Hershkowitz, Anson Kahng, Dominik Peters, and Ariel D. Procaccia. In AAAI '21 (accepted).
PDF - Axioms for Learning from Pairwise Comparisons.
Ritesh Noothigattu, Dominik Peters, and Ariel D. Procaccia. In NeurIPS '20.
PDF - Explainable Voting.
Dominik Peters, Ariel D. Procaccia, Alexandros Psomas, Zixin Zhou. In NeurIPS '20.
PDF - Proportionality and the Limits of Welfarism.
Dominik Peters and Piotr Skowron. In EC '20.
PDF · arXiv - Approval-Based Apportionment.
Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, and Kai-Henning Wilker. In AAAI '20.
PDF · arXiv - Preventing Arbitrage from Collusion When Eliciting Probabilities.
Rupert Freeman, David M. Pennock, Dominik Peters, and Bo Waggoner. In AAAI '20.
PDF · Full version · Poster · Slides - Price of Fairness in Budget Division and Probabilistic Social Choice.
Marcin Michorzewski, Dominik Peters, and Piotr Skowron. In AAAI '20.
PDF · Poster
2019
- Economic Design for Effective Altruism.
Dominik Peters. Chapter for The Future of Economic Design.
PDF - k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters.
Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, and Hans Georg Seedig. In Journal of Computer and System Sciences 105:130-157, 2019.
PDF · arXiv · Poster - Fractional Hedonic Games.
Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters. In ACM Transactions on Economics and Computation 7(2):6:1-6:29, 2019.
PDF · arXiv - An Axiomatic Characterization of the Borda Mean Rule.
Florian Brandl and Dominik Peters. In Social Choice and Welfare 52(4):685–707, 2019.
PDF · Journal - Portioning using Ordinal Preferences: Fairness and Efficiency.
Stéphane Airiau, Haris Aziz, Ioannis Caragiannis, Justin Kruger, Jérôme Lang, and Dominik Peters. In IJCAI '19.
PDF - Correlating Preferences and Attributes: Nearly Single-Crossing Profiles.
Foram Lakhani, Dominik Peters, and Edith Elkind. In IJCAI '19.
PDF - Truthful Aggregation of Budget Proposals.
Rupert Freeman, David M. Pennock, Dominik Peters, and Jennifer Wortman Vaughan. In EC '19.
PDF · arXiv · Demo - Single Transferable Vote: Incomplete Knowledge and Communication Issues.
Manel Ayadi, Nahla Ben Amor, Jérôme Lang, and Dominik Peters. In AAMAS '19.
PDF - Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints.
Ayumi Igarashi and Dominik Peters. In AAAI '19. Also presented at AI3.
PDF · arXiv · Conference Version · Slides - Almost Envy-Free Allocations with Connected Bundles.
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, and William S. Zwicker. In ITCS '19.
PDF · arXiv · Proceedings Version · Slides
2018
- Proportionality and Strategyproofness in Multiwinner Elections.
Dominik Peters. In AAMAS '18. Also presented at COMSOC '18.
PDF · Slides · Proceedings Version, see Erratum (2020) - Single-Peakedness and Total Unimodularity: New Polynomial-Time Algorithms for Multi-Winner Elections.
Dominik Peters. In AAAI '18. Also presented at ADT '17.
PDF · Slides · arXiv · BibTeX - Effective Heuristics for Committee Scoring Rules.
Piotr Faliszewski, Martin Lackner, Dominik Peters, and Nimrod Talmon. In AAAI '18.
PDF - On Recognising Nearly Single-Crossing Preferences.
Florian Jaeckle, Dominik Peters, and Edith Elkind. In AAAI '18.
PDF
2017
- Computer-aided Methods for Social Choice Theory.
Christian Geist and Dominik Peters. Chapter 13 in Trends in Computational Social Choice.
PDF - Structured Preferences.
Edith Elkind, Martin Lackner, and Dominik Peters. Chapter 10 in Trends in Computational Social Choice.
PDF - Optimal Bounds for the No-Show Paradox via SAT Solving.
Felix Brandt, Christian Geist, and Dominik Peters. In Mathematical Social Sciences 90:18–27, 2017.
PDF · Journal · Poster · arXiv · AAMAS version · Replication Data · BibTeX - Condorcet's Principle and the Preference Reversal Paradox.
Dominik Peters. In TARK '17.
PDF · Slides · BibTeX - Precise Complexity of the Core in Dichotomous and Additive Hedonic Games.
Dominik Peters. In ADT '17.
PDF · Slides · arXiv · BibTeX - Fair Division of a Graph.
Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, and Dominik Peters. In IJCAI '17.
PDF · arXiv · BibTeX - Proportional Rankings.
Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, and Edith Elkind. In IJCAI '17.
PDF · arXiv · BibTeX - Preferences Single-Peaked on a Circle.
Dominik Peters and Martin Lackner. In AAAI '17.
PDF · Poster · BibTeX - Group Activity Selection on Social Networks.
Ayumi Igarashi, Dominik Peters, and Edith Elkind. In AAAI '17.
PDF · arXiv · Draft of journal version - Recognising Multidimensional Euclidean Preferences.
Dominik Peters. In AAAI '17 and COMSOC '16.
PDF · AAAI version · Slides · arXiv · BibTeX
2016
- Preference Restrictions in Computational Social Choice: Recent Progress.
Edith Elkind, Martin Lackner, and Dominik Peters. In IJCAI '16 (Early Career Spotlight Track).
PDF · BibTeX - Interdependent Scheduling Games.
A. Abeliuk, H. Aziz, G. Berbeglia, S. Gaspers, J. Gudmundsson, P. Stursberg, P. Kalina, N. Mattei, D. Peters, P. Van Hentenryck, T. Walsh. In IJCAI '16.
PDF · arXiv · BibTeX - Optimal Bounds for the No-Show Paradox via SAT Solving.
Felix Brandt, Christian Geist, and Dominik Peters. In AAMAS '16 (Nominated for Best Paper Award).
PDF · also see journal version above - Preferences Single-Peaked on Nice Trees.
Dominik Peters and Edith Elkind. In AAAI '16.
PDF · Poster · BibTeX - Graphical Hedonic Games of Bounded Treewidth.
Dominik Peters. In AAAI '16.
PDF · BibTeX - Complexity of Hedonic Games with Dichotomous Preferences.
Dominik Peters. In AAAI '16.
PDF · Poster · BibTeX - Towards Structural Tractability in Hedonic Games. (Student Abstract)
Dominik Peters. In AAAI '16 Student Abstracts.
PDF · Poster