Prof. Dr. Jörg Rothe has headed the Complexity Theory and Cryptology Group at the Institute of Computer Science at MUHS-Gelsenkirchen since 2000. His research interests lie in computational social choice, algorithmic game theory, and fair division, focusing in each case on the algorithmic and complexity-theoretic treatment of the relevant problems.

In the context of DIID, he is interested in formal models of theoretical computer science for the description and evaluation of user interactions in online participation processes.