Kontakt
Lehrstuhl für Algorithmen und Komplexität
(Informatik 1)
RWTH Aachen
Ahornstrasse 55
D-52074 Aachen
Sekretariat:
Erika Schlebusch
Informatikzentrum, E1
Raum 4023
Tel.: +49 (0) 241 80-21101
New Paper at EC 2026 19 May 2026
Our paper "Carbon Pricing in Traffic Networks" (by Svenja Griesbach, Tobias Harks, Max Klimm, Michael Markl, Philipp Warode) was accepted at the 27th Conference on Economics and Computation (EC 2026), the international top conference at the intersection of economics and computer science.
Artikel in der Süddeutschen Zeitung 01 Apr 2026
Im Artikel "So ist es gerecht. Oder?" berichtet die Süddeutsche Zeitung über grundlegende Resultate zu Fair Division und erwähnt dabei auch unsere Forschungen zu Envy-Freeness.
New Paper in Artificial Intelligence 27 Mar 2026
Opinion dynamics model the spread of opinions in social networks. Usually, they capture local trade-offs for agents who adjust their expressed opinions based on internal convictions and peer pressure in their neighborhood. In our paper Opinion Dynamics with Median Aggregation (by Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Marten Maack, Malin Rau, Lisa Wilhelmi) we study a game-theoretic model for opinion dynamics in combination with a global voting mechanism. Apart from the local neighborhood, agents also take the result of a global vote into account. For the important median voting rule, we analyze existence, structure, and computational complexity of equilibrium outcomes. Moreover, we analyze the impact of changes in the susceptability to the voting outcome. The paper has been accepted for publication in Artificial Intelligence, the international top-journal in AI.
Dissertation Defense 17 Mar 2026
Tim Koglin successfully defended his thesis entitled Algorithms for Information and Contract Design in Multi-Agent Network Settings. Congratulations to Dr. Koglin!
New Paper in ACM Transactions on Computation Theory 18 Feb 2026
Trading claims of a bank in distress is described in, e.g., the U.S. and E.U. banking regulations. We formalize this notion in the context of financial networks and study its algorithmic properties. Our paper "Algorithms for Claims Trading" (by Martin Hoefer, Carmine Ventre, Lisa Wilhelmi) characterizes structural properties, provides efficient (approximation) algorithms to compute optimal claims trades, and shows complementing computational hardness results in several variants. Our results reveal an interesting dichotomy -- optimal trading of claims with a common creditor is algorithmically much easier than trading claims with a common debtor. Our paper was invited to a special issue of best papers from STACS 2024 and is now accepted for publication in ACM Transactions on Computation Theory.