Multi-unit Bilateral Trade
P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

 From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation
M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.
LibreCat: /record/10281

Disaggregating User Evaluations Using the Shapley Value
M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.
LibreCat: /record/2831
DOI: 10.1145/3230654.3230659

Congestion games with mixed objectives
M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

Pure Nash equilibria in restricted budget games
M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).
LibreCat: /record/1369
DOI: 10.1007/s10878-018-0269-7

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.
LibreCat: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

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.
LibreCat: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

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.
LibreCat: /record/59
DOI: 10.1145/3087556.3087578

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.
LibreCat: /record/66
DOI: 10.1007/978-3-319-62389-4_15

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.
LibreCat: /record/1094
DOI: 10.1007/978-3-319-59144-5_32

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.
LibreCat: /record/209
DOI: 10.1007/978-3-319-48749-6_47
arXiv: 1607.05143

Routing Games With Progressive Filling
T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.
LibreCat: /record/159
DOI: 10.1109/TNET.2015.2468571

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.
LibreCat: /record/149
DOI: 10.1007/978-3-319-48749-6_43

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).
LibreCat: /record/320
DOI: 10.1145/2614687

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.
LibreCat: /record/271
DOI: 10.1007/978-3-662-48433-3_14
arXiv: 1507.02908

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.
LibreCat: /record/370
DOI: 10.1109/TNET.2015.2468571

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.
LibreCat: /record/451
DOI: 10.1007/978-3-662-44803-8_10

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.
LibreCat: /record/452

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.
LibreCat: /record/453
DOI: 10.1007/978-3-319-13129-0_3

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.
LibreCat: /record/455
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.242