Doctoral Consortium

Welcome to the

2nd Doctoral Consortium held as part of Algorithmic Decision Theory 2017

24 October 2017

[Recent Updates]
[Important Dates]
[Application Instructions]
[Programme and Participants]
[Student Support]

As part of the 5th International Conference on Algorithmic Decision Theory this doctoral consortium will give students the opportunity to meet researchers from closely related fields, present their work, and interact with other students and mentors alike.

Former events: 1st Joint Doctoral Consortium held as part of Algorithmic Decision Theory 2015 and Logic Programming and Non-Monotonic Reasoning 2015.

Recent Updates

  • The Tutorial Slides by Serge Gaspers can be found here!
  • The Programme is online!
  • Deadline Extension: Applications due on 4 June!
  • We are happy to announce that Serge Gaspers (School of Computer Science and Engineering, UNSW Sydney and Data61, CSIRO, Australia) will give a tutorial on

    “An Introduction to
    Parameterized Complexity with Applications in Algorithmic Decision Theory”.

Important Dates

  • 21 May 4 June: Application Due (UTC-12)
  • 24 May 7 June: Notification
  • 9 June 23 June: Camera Ready Copies Due
  • 24 October: Doctoral Consortium Day
  • 25-27 October: ADT Main Conference here

Application Instructions

If you are a PhD student (or at a late stage master level) and interested in attending the doctoral consortium, please send one pdf document via e-mail to Anja Rey (anja.rey at containing the following information:

  1.  Cover Sheet including a short CV: A one page information sheet which should include:
    • Your full name and contact data such as e-mail address, affiliation (address, office phone number, home page if appicable);
    • Your thesis advisor’s full name and affiliation;
    • A list of 2 to 5 keywords that you would use to describe your research;
    • The number of years in your current programme;</width=”90px”li>
    • A summary of your education and academic experience (and other information you consider relevant);
    • A list of up to 5 people within the ADT community you feel would be good mentors or are people you want to talk to (feel inspired, e.g., by the programme committee of this year’s ADT conference and former committees and participants of ADT conferences).
  2. Personal Statement: A short statement not to exceed 1 page which outlines what you hope to gain from the DC and what unique perspective you can contribute to the discussions. Please mention if you have participated in any past DCs or plan to participate in any other DCs. Please also include whether or not you have submitted a paper to ADT.
  3. Extended Abstract: A thesis summary no longer than 4 pages (excluding up to 1 page for references) in which you should:
    • Give a brief background for your research;
    • Explain the central questions of your research;
    • Present what you have accomplished so far;
    • Emphasise the aspects you would like to focus on in a presentation at the DC.

    Please be sure to clearly describe your work (e.g., what you have done, and what you plan to work on), while emphasizing the contributions and their significance. Please use the first person where appropriate.

  4. A list of your publications (accepted or pending).

Students will be selected based on the assessment of the organizing committee. We will give preference to students who have settled on a research topic or direction but still have some way to go in their studies. Applications will be reviewed based on several factors including the quality of the work submitted, stage of research, evidence of research progress, the committee’s assessment of the student’s contribution to and benefit from participating in the DC, and input from the student’s 5advisor.

Programme and Participants


9:50 am – 10:00 am Welcome
10:00 am – 11:20 am Presentations Part I
11:20 am – 11:40 am Coffee Break
11:40 am – 1:00 pm Presentations Part II
1:00 pm – 2:30 pm Mentoring Lunch
2:30 pm – 3:30 pm Tutorial: Serge Gaspers An Introduction to Parameterized Complexity with Applications in Algorithmic Decision Theory
3:30 pm – 3:50 pm Coffee Break
3:50 pm – 4:20 pm Panel Discussion
4:20 pm – 4:30 pm Closing



Adrian Haret
Logic-Based Merging in Fragments of Classical Logic with Inputs from Social Choice Theory

Anna Maria Kerkmann
Strategy-Proofness of Scoring Allocation Correspondences under Social Welfare Maximization

Christian Reger
Strategic Influences on Elections and Group Identification Under Incomplete Information

Dominique Christine Komander
Expanding the Fair Division Framework by Agents with Altruistic Influence

Lisa Rey
Distances in Voting and Committee Election Rules for General Preference Types

Luke Miles
A Simulator for Hedonic Games

Margot Calbrix
Incremental Preference Elicitation for Collective Decision Making

Tobias Alexander Hogrebe
Profile Distances and Optimal Manipulation of Voting Rules

Student Support

Supported by


  • Nicholas Mattei (IBM T.J. Watson Research Center, NY USA)
  • Anja Rey (Technische Universität Dortmund, Germany, Chair)
  • Jörg Rothe (Heinrich-Heine-Universität Düsseldorf, Germany)