Fast convergence to nearly optimal solutions in potential games. - Baruch Awerbuch; Yossi Azar; Amir Epstein; Vahab S. Mirrokni; Alexander Skopalik (EC, 2008)

Inapproximability of pure nash equilibria. - Alexander Skopalik; Berthold Vöcking (STOC, 2008)

Taxing Subnetworks. - Martin Hoefer 001; Lars Olbrich; Alexander Skopalik (WINE, 2008)

Altruism in Congestion Games - Martin Hoefer 001; Alexander Skopalik (CoRR, 2008)

Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. - Heiner Ackermann; Alexander Skopalik (Internet Math., 2008)

Doing Good with Spam Is Hard. - Martin Hoefer 001; Lars Olbrich; Alexander Skopalik (SAGT, 2009)

On the complexity of nash dynamics and sink equilibria. - Vahab S. Mirrokni; Alexander Skopalik (EC, 2009)

Stability and Convergence in Selfish Scheduling with Altruistic Agents. - Martin Hoefer 001; Alexander Skopalik (WINE, 2009)

On the complexity of equilibria in games with succinct representation. - Alexander Skopalik (2010)

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (FOCS, 2011)

Considerate Equilibrium. - Martin Hoefer 001; Michal Penn; Maria Polukarov; Alexander Skopalik; Berthold Vöcking (IJCAI, 2011)

The Shapley Value as a Function of the Quota in Weighted Voting Games. - Yair Zick; Alexander Skopalik; Edith Elkind (IJCAI, 2011)

Efficient computation of approximate pure Nash equilibria - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

On the Impact of Fair Best Response Dynamics. - Angelo Fanelli 001; Luca Moscardelli; Alexander Skopalik (MFCS, 2012)

Social Context in Potential Games. - Martin Hoefer 001; Alexander Skopalik (WINE, 2012)

Computing approximate pure Nash equilibria in congestion games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (SIGecom Exch., 2012)

Computing pure Nash and strong equilibria in bottleneck congestion games. - Tobias Harks; Martin Hoefer 001; Max Klimm; Alexander Skopalik (Math. Program., 2013)

On the Complexity of Pareto-Optimal Nash and Strong Equilibria. - Martin Hoefer 001; Alexander Skopalik (Theory Comput. Syst., 2013)

Altruism in Atomic Congestion Games. - Martin Hoefer 001; Alexander Skopalik (ACM Trans. Economics and Comput., 2013)

Approximate Pure Nash Equilibria in Weighted Congestion Games. - Christoph Hansknecht; Max Klimm; Alexander Skopalik (APPROX-RANDOM, 2014)

Budget-Restricted Utility Games with Ordered Strategic Decisions. - Maximilian Drees; Sören Riechers; Alexander Skopalik (SAGT, 2014)

A simulation framework for analyzing complex infinitely repeated games. - Matthias Feldotto; Alexander Skopalik (SIMULTECH, 2014)

Multilevel Network Games. - Sebastian Abshoff; Andreas Cord-Landwehr; Daniel Jung 001; Alexander Skopalik (WINE, 2014)

Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. - Matthias Feldotto; Martin Gairing; Alexander Skopalik (WINE, 2014)

Approximate Pure Nash Equilibria in Social Context Congestion Games. - Martin Gairing; Grammateia Kotsialou; Alexander Skopalik (WINE, 2014)

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. - Maximilian Drees; Matthias Feldotto; Sören Riechers; Alexander Skopalik (SAGT, 2015)

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (ACM Trans. Economics and Comput., 2015)

Strategic Online Facility Location. - Maximilian Drees; Björn Feldkord; Alexander Skopalik (COCOA, 2016)

Routing Games With Progressive Filling. - Tobias Harks; Martin Hoefer 001; Kevin Schewior; Alexander Skopalik (IEEE/ACM Trans. Netw., 2016)

Congestion Games with Complementarities. - Matthias Feldotto; Lennart Leder; Alexander Skopalik (CIAC, 2017)

Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. - Matthias Feldotto; Thomas John; Dennis Kundisch; Paul Hemsen; Katrin Klingsieck; Alexander Skopalik (DESRIST, 2017)

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. - Peter Kling; Alexander Mäcker; Sören Riechers; Alexander Skopalik (SPAA, 2017)

Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. - Matthias Feldotto; Martin Gairing; Grammateia Kotsialou; Alexander Skopalik (WINE, 2017)

Disaggregating User Evaluations Using the Shapley Value. - Matthias Feldotto; Claus-Jochen Haake; Alexander Skopalik; Nadja Stroh-Maraun (NetEcon@SIGMETRICS, 2018)

Congestion games with mixed objectives. - Matthias Feldotto; Lennart Leder; Alexander Skopalik (J. Comb. Optim., 2018)

Multi-Unit Bilateral Trade. - Matthias Gerstgrasser; Paul W. Goldberg; Bart de Keijzer; Philip Lazos; Alexander Skopalik (AAAI, 2019)

From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. - Matthias Feldotto; Pascal Lenzner; Louise Molitor; Alexander Skopalik (AAMAS, 2019)

Network Investment Games with Wardrop Followers. - Daniel Schmand; Marc Schröder 002; Alexander Skopalik (ICALP, 2019)

Network Investment Game with Wardrop Followers. - Daniel Schmand; Marc Schröder 002; Alexander Skopalik (CoRR, 2019)

Pure Nash equilibria in restricted budget games. - Maximilian Drees; Matthias Feldotto; Sören Riechers; Alexander Skopalik (J. Comb. Optim., 2019)

Improving Approximate Pure Nash Equilibria in Congestion Games. - Vipin Ravindran Vijayalakshmi; Alexander Skopalik (WINE, 2020)

Hiring Secretaries over Time: The Benefit of Concurrent Employment. - Yann Disser; John Fearnley; Martin Gairing; Oliver Göbel 002; Max Klimm; Daniel Schmand; Alexander Skopalik; Andreas Tönnis (Math. Oper. Res., 2020)

Two-Stage Facility Location Games with Strategic Clients and Facilities. - Simon Krogmann; Pascal Lenzner; Louise Molitor; Alexander Skopalik (IJCAI, 2021)

Strategic Facility Location with Clients That Minimize Total Waiting Time. - Simon Krogmann; Pascal Lenzner; Alexander Skopalik (AAAI, 2023)

Strategic Resource Selection with Homophilic Agents. - Jonathan Gadea Harder; Simon Krogmann; Pascal Lenzner; Alexander Skopalik (IJCAI, 2023)

Equilibria in Two-Stage Facility Location with Atomic Clients. - Simon Krogmann; Pascal Lenzner; Alexander Skopalik; Marc Uetz; Marnix C. Vos (IJCAI, 2024)

The Bakers and Millers Game with Restricted Locations. - Simon Krogmann; Pascal Lenzner; Alexander Skopalik (AAMAS, 2025)

Social Welfare in Battery Charging Games. - Simon Krogmann; Pascal Lenzner; Alexander Skopalik; Tobias Sträubig (SAGT, 2025)

Playing Snake on a Graph. - Denise Graafsma; Bodo Manthey; Alexander Skopalik (CoRR, 2025)