Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-588 

Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.

Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.

Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.

Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.

Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.

Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn.

Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn.

Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn.

Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn.