Hello, I'm Dominik. I'm a postdoctoral researcher hosted by Ariel Procaccia at CMU's Computer Science Department.
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 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.
News. I have moved to Carnegie Mellon University for a postdoc hosted by Ariel Procaccia from July 2019. In May 2019, I submitted my thesis on the Fair Division of the Commons. My defense (viva) will be in September. Before then, my official job title is Project Scientist, which sounds much cooler than postdoc.
Updated: 2019-07-16
Recent Papers
- Simple Characterizations of Approval Voting.
Florian Brandl and Dominik Peters. Draft, July 2019.
PDF - Truthful Aggregation of Budget Proposals.
Rupert Freeman, David M. Pennock, Dominik Peters, and Jennifer Wortman Vaughan. In EC '19.
PDF · arXiv - 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 (accepted).
PDF
Recent Posters
Preprints
- newSimple Characterizations of Approval Voting.
Florian Brandl and Dominik Peters. July 2019.
PDF - Group Activity Selection on Social Networks.
Ayumi Igarashi, Robert Bredereck, Dominik Peters, and Edith Elkind. Draft of longer journal version of AAAI '17 paper.
PDF · arXiv
Book Chapters
- Economic Design for Effective Altruism.
Dominik Peters. Draft Chapter for Future of Economic Design (in preparation).
PDF - 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
Journal Publications
- 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 (forthcoming).
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 - Optimal Bounds for the No-Show Paradox via SAT Solving.
Felix Brandt, Christian Geist, and Dominik Peters. In Mathematical Social Science 90:18–27, 2017.
PDF · Journal · Poster · arXiv · AAMAS version · Replication Data · BibTeX
Conference Publications
- newPortioning 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 (accepted).
PDF - newCorrelating Preferences and Attributes: Nearly Single-Crossing Profiles.
Foram Lakhani, Dominik Peters, and Edith Elkind. In IJCAI '19 (accepted).
PDF - newTruthful Aggregation of Budget Proposals.
Rupert Freeman, David M. Pennock, Dominik Peters, and Jennifer Wortman Vaughan. In EC '19.
PDF · arXiv - 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 - 2018Proportionality and Strategyproofness in Multiwinner Elections.
Dominik Peters. In AAMAS '18. Also presented at COMSOC '18.
PDF · Slides - 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 - 2017Condorcet'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 · BibTeX - Recognising Multidimensional Euclidean Preferences.
Dominik Peters. In AAAI '17 and COMSOC '16.
PDF · AAAI version · Slides · arXiv · BibTeX - 2016Preference 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 - 2015Simple Causes of Complexity in Hedonic Games.
Dominik Peters and Edith Elkind. In IJCAI '15 and CoopMAS '15.
PDF · Poster · arXiv · BibTeX