Computational Social Choice

  • Turnus / Umfang:
    • Wintersemester 2024/2025 / 4 SWS (6 ECTS)
       
  • Zusammenfassung:
    • This course will explore a range of collective decision-making methodologies used in various contexts. It will focus on three main aspects: (1) How do various rules work? (2) What are the key considerations and criteria involved in designing these decision-making rules? (3) What are the important combinatorial problems related to these rules, and are there efficient algorithms to solve them?
       
  • Gliederung:
    • Introduction
    • Voting systems
    • Structured preferences
    • Participatory
    • Judgement aggregation
    • Tournament solutions
    • Hedonic games
    • Multiagent resource allocation
       
  • Literatur:
    • Tovey, C. A. (2002): Tutorial on Computational Complexity. Interfaces 32: 30–61.
    • Downey, R. (2012): A Parameterized Complexity Tutorial. in LATA.
    • Cygan, M., et al. (2015): Parameterized Algorithms. Springer.
    • Brandt, F., et al. (2016): Handbook of Computational Social Choice. Cambridge University Press.
    • Elkind, E., et al. (2022): Preference Restrictions in Computational Social Choice: A Survey.
    • Elkind, E., et al. (2017): Properties of Multiwinner Voting Rules. Soc. Choice Welf. 48(3): 599–632. 
    • Yang, Y. (2019): On the Tree Representations of Dichotomous Preferences. in IJCAI: 644-650.
    • Lackner, M., Skowron, P. (2023): Multi-Winner Voting with Approval. Springer-Verlag.
    • Aziz, H., et al. (2019): Fractional Hedonic Games. ACM Trans. Economics and Comput. 7(2): 6:1-29.