Dominik Peters

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, and defended it in September (pic). Later this year, I will attend ADT 2019 and perhaps WINE 2019.

Thesis 🎓‍

• newFair Division of the Commons.
  Dominik Peters. DPhil in Computer Science, University of Oxford, September 2019, 200 pages.
  PDF

Updated: 2019-09-11

Recent Papers

• Approval-Based Apportionment.
  Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, and Kai-Henning Wilker. Draft, September 2019.
  PDF
• Preventing Arbitrage from Collusion When Eliciting Probabilities.
  Rupert Freeman, David M. Pennock, Dominik Peters, and Bo Waggoner. Draft, September 2019.
  PDF
• Price of Fairness in Budget Division and Probabilistic Social Choice.
  Marcin Michorzewski, Dominik Peters, and Piotr Skowron. Draft, September 2019.
  PDF
• Simple Characterizations of Approval Voting.
  Florian Brandl and Dominik Peters. Draft, July 2019.
  PDF

Recent Posters

Preprints

• newPreferences Single-Peaked on a Circle.
  Dominik Peters and Martin Lackner. Draft of journal paper, September 2019.
  PDF
• newApproval-Based Apportionment.
  Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, and Kai-Henning Wilker. Draft, September 2019.
  PDF
• newPreventing Arbitrage from Collusion When Eliciting Probabilities.
  Rupert Freeman, David M. Pennock, Dominik Peters, and Bo Waggoner. Draft, September 2019.
  PDF
• newPrice of Fairness in Budget Division and Probabilistic Social Choice.
  Marcin Michorzewski, Dominik Peters, and Piotr Skowron. September 2019.
  PDF
• 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

3. Economic Design for Effective Altruism.
   Dominik Peters. Draft Chapter for Future of Economic Design (in preparation).
   PDF
4. Computer-aided Methods for Social Choice Theory.
   Christian Geist and Dominik Peters. Chapter 13 in Trends in Computational Social Choice.
   PDF
5. Structured Preferences.
   Edith Elkind, Martin Lackner, and Dominik Peters. Chapter 10 in Trends in Computational Social Choice.
   PDF

Journal Publications

4. 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
5. 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
6. 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
7. 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

25. 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.
    PDF
26. newCorrelating Preferences and Attributes: Nearly Single-Crossing Profiles.
    Foram Lakhani, Dominik Peters, and Edith Elkind. In IJCAI '19.
    PDF
27. newTruthful Aggregation of Budget Proposals.
    Rupert Freeman, David M. Pennock, Dominik Peters, and Jennifer Wortman Vaughan. In EC '19.
    PDF · arXiv
28. Single Transferable Vote: Incomplete Knowledge and Communication Issues.
    Manel Ayadi, Nahla Ben Amor, Jérôme Lang, and Dominik Peters. In AAMAS '19.
    PDF
29. Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints.
    Ayumi Igarashi and Dominik Peters. In AAAI '19. Also presented at AI³.
    PDF · arXiv · Conference Version · Slides
30. 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
31. 2018Proportionality and Strategyproofness in Multiwinner Elections.
    Dominik Peters. In AAMAS '18. Also presented at COMSOC '18.
    PDF · Slides
32. 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
33. Effective Heuristics for Committee Scoring Rules.
    Piotr Faliszewski, Martin Lackner, Dominik Peters, and Nimrod Talmon. In AAAI '18.
    PDF
34. On Recognising Nearly Single-Crossing Preferences.
    Florian Jaeckle, Dominik Peters, and Edith Elkind. In AAAI '18.
    PDF
35. 2017Condorcet's Principle and the Preference Reversal Paradox.
    Dominik Peters. In TARK '17.
    PDF · Slides · BibTeX
36. Precise Complexity of the Core in Dichotomous and Additive Hedonic Games.
    Dominik Peters. In ADT '17.
    PDF · Slides · arXiv · BibTeX
37. Fair Division of a Graph.
    Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, and Dominik Peters. In IJCAI '17.
    PDF · arXiv · BibTeX
38. Proportional Rankings.
    Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, and Edith Elkind. In IJCAI '17.
    PDF · arXiv · BibTeX
39. Preferences Single-Peaked on a Circle.
    Dominik Peters and Martin Lackner. In AAAI '17.
    PDF · Poster · BibTeX
40. Group Activity Selection on Social Networks.
    Ayumi Igarashi, Dominik Peters, and Edith Elkind. In AAAI '17.
    PDF · arXiv · BibTeX
41. Recognising Multidimensional Euclidean Preferences.
    Dominik Peters. In AAAI '17 and COMSOC '16.
    PDF · AAAI version · Slides · arXiv · BibTeX
42. 2016Preference Restrictions in Computational Social Choice: Recent Progress.
    Edith Elkind, Martin Lackner, and Dominik Peters. In IJCAI '16 (Early Career Spotlight Track).
    PDF · BibTeX
43. 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
44. 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
45. Preferences Single-Peaked on Nice Trees.
    Dominik Peters and Edith Elkind. In AAAI '16.
    PDF · Poster · BibTeX
46. Graphical Hedonic Games of Bounded Treewidth.
    Dominik Peters. In AAAI '16.
    PDF · BibTeX
47. Complexity of Hedonic Games with Dichotomous Preferences.
    Dominik Peters. In AAAI '16.
    PDF · Poster · BibTeX
48. Towards Structural Tractability in Hedonic Games. (Student Abstract)
    Dominik Peters. In AAAI '16 Student Abstracts.
    PDF · Poster
49. 2015Simple Causes of Complexity in Hedonic Games.
    Dominik Peters and Edith Elkind. In IJCAI '15 and CoopMAS '15.
    PDF · Poster · arXiv · BibTeX