I am a PhD student in the group of Prof. Brandt since February 2020. Before that, I studied Informatics at TUM, where I received my Bachelor's degree in 2018 and my Master's degree in 2020. My research focuses on decision making in groups, in particular on how to avoid manipulability in elections. 

P. Lederer. Strategyproof randomized social choice for restricted sets of utility functions. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), 2021. Forthcoming. [ pdf | venue ]

P. Lederer. Non-manipulability in set-valued and probabilistic social choice theory (doctoral consortium). In Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1823–1825, 2021. [ link | pdf | venue ]

F. Brandt, P. Lederer, and R. Romen. Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes. In Proceedings of the 8th International Workshop on Computational Social Choice (COMSOC), 2021. [ pdf ]

F. Brandt, M. Bullinger, and P. Lederer. On the indecisiveness of Kelly-strategyproof social choice functions. In Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 251–259, 2021. [ link | pdf | venue ]

P. Lederer. Kelly-strategyproof social choice functions. Master's thesis, Technical University of Munich, 2020.

Community service

Refereeing Conferences and Workshops

Teaching

Courses

• Seminar on Markets, Algorithms, Incentives, and Networks (WS 2020/21)
• Economics and Computation (SS 2020, SS 2021)

Student Projects

• Master's thesis  Understanding the SD impossibiliy theorem (Alexander Thole, in progress)
• Master's thesis  Characterizing the Condorcet Rule (Sascha Tausch, 2021)
• Master's thesis  Non-manipulable Social Desicision Schemes (Rene Romen, 2020)

Contact me if you are interested in a bachelor thesis/ master thesis in computational social choice!