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

Drees, M., Feldotto, M., Riechers, S., &; Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187).https://doi.org/10.1007/978-3-319-62389-4_15 

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.

Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., &; Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) (pp. 462–467).https://doi.org/10.1007/978-3-319-59144-5_32 

John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., &; Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979).

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

Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn.

Polevoy, G., de Weerdt, M. M., &; Jonker, C. M. (2016). The Game of Reciprocation Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence (Vol. Volume 285: ECAI 2016, pp. 417–425).https://doi.org/10.3233/978-1-61499-672-9-417 

Polevoy, G., de Weerdt, M., &; Jonker, C. (2016). The Convergence of Reciprocation. In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.

Feldotto, M., Leder, L., &; Skopalik, A. (2016). Congestion Games with Mixed Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 655--669).https://doi.org/10.1007/978-3-319-48749-6_47 

Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn.

Harks, T., Höfer, M., Schewior, K., &; Skopalik, A. (2016). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562.https://doi.org/10.1109/TNET.2015.2468571 

Drees, M., Feldkord, B., &; Skopalik, A. (2016). Strategic Online Facility Location. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 593--607).https://doi.org/10.1007/978-3-319-48749-6_43 

Feldotto, M., &; Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience, 28(5), 1655–1677.https://doi.org/10.1002/cpe.3716 

Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität Paderborn.

Caragiannis, I., Fanelli, A., Gravin, N., &; Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation, 3(1).https://doi.org/10.1145/2614687 

Pautz, J. (2015). Budget Games with priced strategies. Universität Paderborn.