2026S

• Algorithmic Social Choice / 192.118 / VU
• Seminar in Artificial Intelligence Algorithmic and Computational Decision Theory / 192.119 / SE

• Partitioned Combinatorial Optimization Games / Chen, J., Hatschka, C., & Simola, S. (2025). Partitioned Combinatorial Optimization Games. In I. Lynce, N. Murano, M. Vallati, S. Villata, F. Chesani, M. Milano, A. Omicini, & M. Dastani (Eds.), ECAI 2025 : 28th European Conference on Artificial Intelligence : Including 14th Conference on Prestigious Applications of Intelligent Systems (PAIS 2025). IOS Press. https://doi.org/10.3233/FAIA250962
  Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)
• Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity / Chen, J., Durand, M., & Hatschka, C. (2025). Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity. In J. Kwok (Ed.), Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence (pp. 3780–3787). https://doi.org/10.24963/ijcai.2025/420
  Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)
• Multi-Winner Reconfiguration / Chen, J., Hatschka, C., & Simola, S. H. E. (2024, December 11). Multi-Winner Reconfiguration [Poster Presentation]. 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada. http://hdl.handle.net/20.500.12708/210385
• Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences / Chen, J., Hatschka, C., & Simola, S. (2023). Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences. In ECAI 2023 : 26th European Conference on Artificial Intelligence, September 30–October 4, 2023, Kraków, Poland. Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023). Proceedings (pp. 397–404). IOS Press. https://doi.org/10.3233/FAIA230296
  Download: PDF (337 KB)
  Project: Structural and Algorithmic Aspects of Preference-based Problems in Social Choice (2019–2027)
• Deontic Paradoxes in ASP with Weak Constraints / Ciabattoni, A., Eiter, T., & Hatschka, C. (2023). Deontic Paradoxes in ASP with Weak Constraints. In Proceedings 39th International Conference on Logic Programming (pp. 367–380).
  Project: TAIGER (2023–2027)
• Representing Normative Reasoning in Answer Set Programming Using Weak Constraints / Hatschka, C., Ciabattoni, A., & Eiter, T. (2022, November 28). Representing Normative Reasoning in Answer Set Programming Using Weak Constraints [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria. http://hdl.handle.net/20.500.12708/154091
• Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts / Brand, C., Ceylan, E., Ganian, R., Hatschka, C., & Korchemna, V. (2022). Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. In M. A. Bekos & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 98–113). Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-031-15914-5_8
• Representing normative reasoning in answer set programming using weak constraints / Hatschka, C. (2022). Representing normative reasoning in answer set programming using weak constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99420
  Download: PDF (925 KB)