Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “Multi-Unit Bilateral Trade.”https://doi.org/10.1609/aaai.v33i01.33011973__In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.https://doi.org/10.1609/aaai.v33i01.33011973 .

Feldotto, Matthias, Pascal  Lenzner, Louise Molitor, and Alexander Skopalik. “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, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.

Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.”https://doi.org/10.1145/3230654.3230659__In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 5:1-5:6, 2018.https://doi.org/10.1145/3230654.3230659 .

Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.”https://doi.org/10.1007/s10878-017-0189-y__Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67.https://doi.org/10.1007/s10878-017-0189-y .

Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.”https://doi.org/10.1007/s10878-018-0269-7__Journal of Combinatorial Optimization, 2018.https://doi.org/10.1007/s10878-018-0269-7 .

Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.”https://doi.org/10.1007/978-3-319-57586-5_19__In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017.https://doi.org/10.1007/978-3-319-57586-5_19 .

Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.”https://doi.org/10.1007/978-3-319-71924-5_14__In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.https://doi.org/10.1007/978-3-319-71924-5_14 .

Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.”https://doi.org/10.1145/3087556.3087578__In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017.https://doi.org/10.1145/3087556.3087578 .

Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.”https://doi.org/10.1007/978-3-319-62389-4_15__In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017.https://doi.org/10.1007/978-3-319-62389-4_15 .

Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.”https://doi.org/10.1007/978-3-319-59144-5_32__In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017.https://doi.org/10.1007/978-3-319-59144-5_32 .

Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.”https://doi.org/10.1007/978-3-319-48749-6_47__In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 655--669. LNCS, 2016.https://doi.org/10.1007/978-3-319-48749-6_47 .

Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.”https://doi.org/10.1109/TNET.2015.2468571__IEEE/ACM Transactions on Networking, no. 4 (2016): 2553–62.https://doi.org/10.1109/TNET.2015.2468571 .

Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.”https://doi.org/10.1007/978-3-319-48749-6_43__In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016.https://doi.org/10.1007/978-3-319-48749-6_43 .

Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.”https://doi.org/10.1145/2614687__Transactions on Economics and Computation 3, no. 1 (2015).https://doi.org/10.1145/2614687 .

Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.”https://doi.org/10.1007/978-3-662-48433-3_14__In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015.https://doi.org/10.1007/978-3-662-48433-3_14 .

Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.”https://doi.org/10.1109/TNET.2015.2468571__In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 352–60, 2014.https://doi.org/10.1109/TNET.2015.2468571 .

Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted Utility Games with Ordered Strategic Decisions.”https://doi.org/10.1007/978-3-662-44803-8_10__In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 110–21. Lecture Notes in Computer Science, 2014.https://doi.org/10.1007/978-3-662-44803-8_10 .

Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.

Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.”https://doi.org/10.1007/978-3-319-13129-0_3__In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 30–43. LNCS, 2014.https://doi.org/10.1007/978-3-319-13129-0_3 .

Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.”https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242__In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 242–57. LIPIcs, 2014.https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242 .