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

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

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource
P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.

Pure Nash Equilibria in Restricted Budget Games
M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.

Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App
M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, A. Skopalik, in: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.

Congestion Games with Mixed Objectives
M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.

Routing Games With Progressive Filling
T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.

Strategic Online Facility Location
M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015).

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.

Routing Games with Progressive Filling
T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.

Budget-restricted utility games with ordered strategic decisions
M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.

Brief Announcement: A Model for Multilevel Network Games
S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.

Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.

Approximate pure Nash equilibria in weighted congestion games
C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.

Approximate pure Nash equilibria in Social Context Congestion Games
M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.

A Simulation Framework for Analyzing Complex Infinitely Repeated Games
M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.

Multilevel Network Games
S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.