Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., &; de Keijzer, B. (2019).https://doi.org/10.1609/aaai.v33i01.33011973__Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA.https://doi.org/10.1609/aaai.v33i01.33011973 

Feldotto, M., Lenzner, P., Molitor, L., &; Skopalik, A. (2019).  From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems.

Feldotto, M., Haake, C.-J., Skopalik, A., &; Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6). Irvine, California, USA.https://doi.org/10.1145/3230654.3230659 

Feldotto, M., Leder, L., &; Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167.https://doi.org/10.1007/s10878-017-0189-y 

Drees, M., Feldotto, M., Riechers, S., &; Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization.https://doi.org/10.1007/s10878-018-0269-7 

Feldotto, M., Leder, L., &; Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233).https://doi.org/10.1007/978-3-319-57586-5_19 

Feldotto, M., Gairing, M., Kotsialou, G., &; Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In Proceedings of the 13th International Conference on Web and Internet Economics (WINE).https://doi.org/10.1007/978-3-319-71924-5_14 

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 

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 

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 

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 

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 

Drees, M., Feldotto, M., Riechers, S., &; Skopalik, A. (2015). On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT) (pp. 178–189).https://doi.org/10.1007/978-3-662-48433-3_14 

Harks, T., Höfer, M., Schewior, K., &; Skopalik, A. (2014). Routing Games with Progressive Filling. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14) (pp. 352–360).https://doi.org/10.1109/TNET.2015.2468571 

Drees, M., Riechers, S., &; Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121).https://doi.org/10.1007/978-3-662-44803-8_10 

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

Feldotto, M., Gairing, M., &; Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 30–43).https://doi.org/10.1007/978-3-319-13129-0_3 

Hansknecht, C., Klimm, M., &; Skopalik, A. (2014). Approximate pure Nash equilibria in weighted congestion games. In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) (pp. 242–257).https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242