On Dynamics in Basic Network Creation Games. - Pascal Lenzner (SAGT, 2011)

Balanced Interval Coloring. - Antonios Antoniadis 001; Falk Hüffner; Pascal Lenzner; Carsten Moldenhauer; Alexander Souza (STACS, 2011)

Greedy Selfish Network Creation. - Pascal Lenzner (WINE, 2012)

On dynamics in selfish network creation. - Bernd Kawald; Pascal Lenzner (SPAA, 2013)

On Approximate Nash Equilibria in Network Design. - Susanne Albers; Pascal Lenzner (Internet Math., 2013)

On selfish network creation. - Pascal Lenzner (2014)

Network Creation Games: Think Global - Act Local. - Andreas Cord-Landwehr; Pascal Lenzner (MFCS (2), 2015)

On Selfish Creation of Robust Networks. - Ankit Chauhan; Pascal Lenzner; Anna Melnichenko; Martin Münn (SAGT, 2016)

Selfish Network Creation with Non-uniform Edge Cost. - Ankit Chauhan; Pascal Lenzner; Anna Melnichenko; Louise Molitor (SAGT, 2017)

Efficient Best Response Computation for Strategic Network Formation Under Attack. - Tobias Friedrich 001; Sven Ihde; Christoph Keßler; Pascal Lenzner; Stefan Neubert; David Schumann (SAGT, 2017)

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. - Tobias Friedrich 001; Sven Ihde; Christoph Keßler; Pascal Lenzner; Stefan Neubert; David Schumann (SPAA, 2017)

Schelling Segregation with Strategic Agents. - Ankit Chauhan; Pascal Lenzner; Louise Molitor (SAGT, 2018)

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

Convergence and Hardness of Strategic Schelling Segregation. - Hagen Echzell; Tobias Friedrich 001; Pascal Lenzner; Louise Molitor; Marcus Pappik; Friedrich Schöne; Fabian Sommer; David Stangl (WINE, 2019)

A Strategic Routing Framework and Algorithms for Computing Alternative Paths. - Thomas Bläsius; Maximilian Böther; Philipp Fischbeck; Tobias Friedrich 001; Alina Gries; Falk Hüffner; Otto Kißig; Pascal Lenzner; Louise Molitor; Leon Schiller; Armin Wells; Simon Wietheger (ATMOS, 2020)

Fair Tree Connection Games with Topology-Dependent Edge Cost. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko; Louise Molitor (FSTTCS, 2020)

Flow-Based Network Creation Games. - Hagen Echzell; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko (IJCAI, 2020)

On the Tree Conjecture for the Network Creation Game. - Davide Bilò; Pascal Lenzner (Theory Comput. Syst., 2020)

Selfish Creation of Social Networks. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Stefanie Lowski; Anna Melnichenko (AAAI, 2021)

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

Efficiency and Stability in Euclidean Network Design. - Wilhelm Friedemann; Tobias Friedrich 001; Hans Gawendowicz; Pascal Lenzner; Anna Melnichenko; Jannik Peters 001; Daniel Stephan; Michael Vaichenker (SPAA, 2021)

Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. - Davide Bilò; Vittorio Bilò; Pascal Lenzner; Louise Molitor (IJCAI, 2022)

Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. - Pascal Führlich; Ágnes Cseh; Pascal Lenzner (EC, 2022)

Topological influence and locality in swap schelling games. - Davide Bilò; Vittorio Bilò; Pascal Lenzner; Louise Molitor (Auton. Agents Multi Agent Syst., 2022)

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

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. - Ivan Khomutovskiy; Rebekka Dunker; Jessica Dierking; Julian Egbert; Christian Helms; Finn Schöllkopf; Katrin Casel; Philipp Fischbeck; Tobias Friedrich 001; Davis Issac; Simon Krogmann; Pascal Lenzner (ALENEX, 2023)

Equilibria and Convergence in Fire Sale Games. - Nils Bertschinger; Martin Hoefer 001; Simon Krogmann; Pascal Lenzner; Steffen Schuldenzucker; Lisa Wilhelmi (AAMAS, 2023)

The Swiss Gambit. - Ágnes Cseh; Pascal Führlich; Pascal Lenzner (AAMAS, 2023)

Schelling Games with Continuous Types (short paper). - Davide Bilò; Vittorio Bilò; Michelle Döring; Pascal Lenzner; Louise Molitor; Jonas Schmidt 002 (ICTCS, 2023)

Schelling Games with Continuous Types. - Davide Bilò; Vittorio Bilò; Michelle Döring; Pascal Lenzner; Louise Molitor; Jonas Schmidt 002 (IJCAI, 2023)

Temporal Network Creation Games. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (IJCAI, 2023)

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

The Impact of Cooperation in Bilateral Network Creation. - Tobias Friedrich 001; Hans Gawendowicz; Pascal Lenzner; Arthur Zahn (PODC, 2023)

Single-Peaked Jump Schelling Games. - Tobias Friedrich 001; Pascal Lenzner; Louise Molitor; Lars Seifert (SAGT, 2023)

Code for "Equilibria and Convergence in Fire Sale Games" (AAMAS 2023). - Nils Bertschinger; Martin Hoefer 001; Simon Krogmann; Pascal Lenzner; Steffen Schuldenzucker; Lisa Wilhelmi (Zenodo, 2023)

Code for "Equilibria and Convergence in Fire Sale Games" (AAMAS 2023). - Nils Bertschinger; Martin Hoefer 001; Simon Krogmann; Pascal Lenzner; Steffen Schuldenzucker; Lisa Wilhelmi (Zenodo, 2023)

Social Distancing Network Creation. - Tobias Friedrich 001; Hans Gawendowicz; Pascal Lenzner; Anna Melnichenko (Algorithmica, 2023)

How to Reduce Temporal Cliques to Find Sparse Spanners. - Sebastian Angrick; Ben Bals; Tobias Friedrich 001; Hans Gawendowicz; Niko Hastrich; Nicolas Klodt; Pascal Lenzner; Jonas Schmidt 002; George Skretas; Armin Wells (ESA, 2024)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. - Andrei Constantinescu 001; Pascal Lenzner; Rebecca Reiffenhäuser; Daniel Schmand; Giovanna Varricchio (ICALP, 2024)

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

Towards Linear Spanners in All Temporal Cliques. - Sebastian Angrick; Ben Bals; Tobias Friedrich 001; Hans Gawendowicz; Niko Hastrich; Nicolas Klodt; Pascal Lenzner; Jonas Schmidt 002; George Skretas; Armin Wells (CoRR, 2024)

Geometric Network Creation Games. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko (SIAM J. Discret. Math., 2024)

Asynchronous opinion dynamics in social networks. - Petra Berenbrink; Martin Hoefer 001; Dominik Kaaser; Pascal Lenzner; Malin Rau; Daniel Schmand (Distributed Comput., 2024)

Strategic Network Creation for Enabling Greedy Routing. - Julian Berger; Tobias Friedrich 001; Pascal Lenzner; Paraskevi Machaira; Janosch Ruff (AAAI, 2025)

Network Creation Games with 2-Neighborhood Maximization. - Merlin de La Haye; Pascal Lenzner; Daniel Schmand; Nicole Schröder (CIAC (2), 2025)

Temporal Network Creation Games: The Impact of Non-Locality and Terminals. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (AAMAS, 2025)

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)

Network creation with homophilic agents. - Martin Bullinger; Pascal Lenzner; Anna Melnichenko (Soc. Choice Welf., 2025)