Recent Posters

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. Two acccepted papers (cake-cutting, proprank) at IJCAI-17. One paper (halfway) presented at TARK-17. Three papers (spoc, euclid, gasp) presented at AAAI-17. I will not be at IJCAI-17, but I will be at ADT-17 and hopefully at AAAI-18. This summer, I will be visiting Markus Brill (7-10 Aug), Jérôme Lang (4–15 Sep) and Felix Brandt (16–29 Sep). Recently, I have co-written two book chapters (sat, structure) for a forthcoming volume on Computational Social Choice edited by Ulle Endriss.

Preprints

Book Chapters

  1. Computer-aided Methods for Social Choice Theory.
    Christian Geist and Dominik Peters. Chapter in Trends in Computational Social Choice (forthcoming).
    PDF
  2. Structured Preferences.
    Edith Elkind, Martin Lackner, and Dominik Peters. Chapter in Trends in Computational Social Choice (forthcoming).
    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 (forthcoming).
    PDF · Journal · Poster · arXiv · AAMAS version · Replication Data · BibTeX

Conference Publications

  1. Condorcet's Principle and the Preference Reversal Paradox.
    Dominik Peters. In TARK '17.
    PDF · Slides · BibTeX
  2. Precise Complexity of the Core in Dichotomous and Additive Hedonic Games.
    Dominik Peters. In ADT '17 (accepted).
    PDF · arXiv
  3. Fair Division of a Graph.
    Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, and Dominik Peters. In IJCAI '17.
    PDF · arXiv · BibTeX
  4. Proportional Rankings.
    Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, and Edith Elkind. In IJCAI '17.
    PDF · arXiv · BibTeX
  5. Preferences Single-Peaked on a Circle.
    Dominik Peters and Martin Lackner. In AAAI '17.
    PDF · Poster · BibTeX
  6. Group Activity Selection on Social Networks.
    Ayumi Igarashi, Dominik Peters, and Edith Elkind. In AAAI '17.
    PDF · arXiv · BibTeX
  7. Recognising Multidimensional Euclidean Preferences.
    Dominik Peters. In AAAI '17 and COMSOC '16.
    PDF · AAAI version · Slides · arXiv · BibTeX
  8. Preference Restrictions in Computational Social Choice: Recent Progress.
    Edith Elkind, Martin Lackner, and Dominik Peters. In IJCAI '16 (Early Career Spotlight Track).
    PDF · BibTeX
  9. 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
  10. 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
  11. Preferences Single-Peaked on Nice Trees.
    Dominik Peters and Edith Elkind. In AAAI '16.
    PDF · Poster · BibTeX
  12. Graphical Hedonic Games of Bounded Treewidth.
    Dominik Peters. In AAAI '16.
    PDF · BibTeX
  13. Complexity of Hedonic Games with Dichotomous Preferences.
    Dominik Peters. In AAAI '16.
    PDF · Poster · BibTeX
  14. Towards Structural Tractability in Hedonic Games. (Student Abstract)
    Dominik Peters. In AAAI '16 Student Abstracts.
    PDF · Poster
  15. Simple 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