M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.

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

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

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

M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” Journal of Combinatorial Optimization, 2018.

M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.

M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.

G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 2017, pp. 3–17.

G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.

G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.