Recent Posters

How To Split A Budget Based on Approvals (Poster) Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints (Poster) Effective Heuristics for Committee Scoring Rules (Poster) Preferences Single-Peaked on a Circle (Poster) Kemeny is NP-hard for 7 Voters (Poster) Optimal Bounds for the No-Show Paradox via SAT Solving (Poster) Towards Structural Tractability in Hedonic Games (Poster) Preferences Single-Peaked on Nice Trees (Poster) Complexity of Hedonic Games with Dichotomous Preferences (Poster) Simple Causes of Complexity in Hedonic Games (Poster)

News. I'm now entering the fourth and last year of my PhD, intending to submit my thesis in May 2019 and defending in June 2019. Most of my recent thinking is on topics of participatory budgeting and public goods; drafts forthcoming. With Ayumi Igarashi, we have a new draft on efficient allocation of indivisible goods.

Preprints

Book Chapters

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

Journal Publications

  1. Optimal Bounds for the No-Show Paradox via SAT Solving.
    Felix Brandt, Christian Geist, and Dominik Peters. In Mathematical Social Science (2017).
    PDF · Journal · Poster · arXiv · AAMAS version · Replication Data · BibTeX

Conference Publications

  1. 2018Proportionality and Strategyproofness in Multiwinner Elections.
    Dominik Peters. In AAMAS '18. Also presented at COMSOC '18.
    PDF · Slides
  2. 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
  3. Effective Heuristics for Committee Scoring Rules.
    Piotr Faliszewski, Martin Lackner, Dominik Peters, and Nimrod Talmon. In AAAI '18.
    PDF
  4. On Recognising Nearly Single-Crossing Preferences.
    Florian Jaeckle, Dominik Peters, and Edith Elkind. In AAAI '18.
    PDF
  5. 2017Condorcet's Principle and the Preference Reversal Paradox.
    Dominik Peters. In TARK '17.
    PDF · Slides · BibTeX
  6. Precise Complexity of the Core in Dichotomous and Additive Hedonic Games.
    Dominik Peters. In ADT '17.
    PDF · Slides · arXiv · BibTeX
  7. Fair Division of a Graph.
    Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, and Dominik Peters. In IJCAI '17.
    PDF · arXiv · BibTeX
  8. Proportional Rankings.
    Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, and Edith Elkind. In IJCAI '17.
    PDF · arXiv · BibTeX
  9. Preferences Single-Peaked on a Circle.
    Dominik Peters and Martin Lackner. In AAAI '17.
    PDF · Poster · BibTeX
  10. Group Activity Selection on Social Networks.
    Ayumi Igarashi, Dominik Peters, and Edith Elkind. In AAAI '17.
    PDF · arXiv · BibTeX
  11. Recognising Multidimensional Euclidean Preferences.
    Dominik Peters. In AAAI '17 and COMSOC '16.
    PDF · AAAI version · Slides · arXiv · BibTeX
  12. 2016Preference Restrictions in Computational Social Choice: Recent Progress.
    Edith Elkind, Martin Lackner, and Dominik Peters. In IJCAI '16 (Early Career Spotlight Track).
    PDF · BibTeX
  13. 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
  14. 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
  15. Preferences Single-Peaked on Nice Trees.
    Dominik Peters and Edith Elkind. In AAAI '16.
    PDF · Poster · BibTeX
  16. Graphical Hedonic Games of Bounded Treewidth.
    Dominik Peters. In AAAI '16.
    PDF · BibTeX
  17. Complexity of Hedonic Games with Dichotomous Preferences.
    Dominik Peters. In AAAI '16.
    PDF · Poster · BibTeX
  18. Towards Structural Tractability in Hedonic Games. (Student Abstract)
    Dominik Peters. In AAAI '16 Student Abstracts.
    PDF · Poster
  19. 2015Simple Causes of Complexity in Hedonic Games.
    Dominik Peters and Edith Elkind. In IJCAI '15 and CoopMAS '15.
    PDF · Poster · arXiv · BibTeX
    We develop a framework that shows that deciding whether a hedonic game admits a stable outcome is NP-hard for a large number of classes of hedonic games, unifying and extending the previously known hardness results in the field.


Working on...

Get in touch if you would like to know more or want to collaborate :)

Wikipedia articles I have written