**Chair for**** Algorithm Engineering**

Hasso Plattner Institute

Office: A-1.5

Tel.: +49 331 5509-419

E-Mail: Pascal.Lenzner(at)hpi.de

## Research Interests

My research interests are manifold and lie in the intersection of algorithms, game theory and computational complexity.

I'm especially interested in:

- Algorithmic Game Theory, in particular the impact of selfish behavior in optimization problems
- Network Science, in particular modeling and analyzing network creation by selfish agents
- Network Design and algorithmic problems on graphs in general
- Game-theoretic analysis of models from Sociology (e.g. Schelling's segregation model) and Economics (e.g. the Hotelling-Downs model)

## News

- In the upcoming winter semester I will teach Algorithmic Problem Solving (together with Timo Kötzing) and Graph Algorithms (together with Katrin Casel). Please feel free to join!
- Together with Ágnes Cseh I am organizing the 17th Conference on Web and Internet Economics (WINE 2021) in Potsdam, Germany
- Our paper
**Two-Stage Facility Location Games with Strategic Clients and Facilities**(with Simon Krogmann, Louise Molitor and Alexander Skopalik) has been accepted at IJCAI'21. The full version of the paper is on arxiv. - Our paper
**Efficiency and Stability in Euclidean Network Design**(with Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Anna Melnichenko, Jannik Peters, Daniel Stephan and Michael Vaichenker) has been accepted at SPAA'21. This paper is the outcome of our summer 2020 master project. The full version of the paper is on arxiv. - In the current summer semester I'm teaching (Advanced) Competitive Programming (with Philipp Fischbeck and Christopher Weyand).
- Our paper
**Selfish Creation of Social Networks**(with Davide Bilò, Tobias Friedrich, Stefanie Lowski and Anna Melnichenko) has been accepted at AAAI'21. The full version of the paper is on arxiv. - I served in the program committee of SAGT 2021, held in Aarhus, Denmark

## Short CV

**Education:**

2014: PhD degree (Dr. rer. nat.) in computer science from Humboldt-University Berlin, Germany

2009: Diploma degree in computer science (Dipl.-Inf.) from Friedrich-Schiller-University Jena, Germany

2007 - 2009: Studies in theoretical computer science at ETH Zürich, Switzerland

2003 - 2007: Studies in computer science at Friedrich-Schiller-University Jena, Germany

### Positions:

Starting 10/2020: Associated Member in the Research Unit Algorithms, Dynamics and Information Flow in Networks (ADYN) funded by the German Science Foundation

Starting 08/2020: Principal Investigator for the project Geometric Selfish Network Creation (GEONET) funded by the German Science Foundation

Starting 10/2015: PostDoc in the Algorithm Engineering Group at Hasso-Plattner-Institute Potsdam, Germany

2014 - 2015: PostDoc in the Complexity and the Theoretical Computer Science I groups at Friedrich-Schiller-University Jena, Germany

2014: PostDoc in the Algorithms & Complexity Group at Humboldt-University Berlin, Germany

2009 - 2014: PhD Student in the Algorithms & Complexity Group at Humboldt-University Berlin, Germany

2021 [ nach oben ]

- Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Lowski, Stefanie; Melnichenko, Anna
**Selfish Creation of Social Networks**Conference on Artificial Intelligence (AAAI) 2021 - Krogmann, Simon; Lenzner, Pascal; Molitor, Louise; Skopalik, Alexander
**Two-Stage Facility Location Games with Strategic Clients and Facilities**International Joint Conference on Artificial Intelligence (IJCAI) 2021 - Friedemann, Wilhelm; Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna; Peters, Jannik; Stephan, Daniel; Vaichenker, Michael
**Efficiency and Stability in Euclidean Network Design**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2021: 232–242

2020 [ nach oben ]

- Bilò, Davide; Lenzner, Pascal
**On the Tree Conjecture for the Network Creation Game**Theory of Computing Systems 2020: 422–443 - Bläsius, Thomas; Böther, Maximilian; Fischbeck, Philipp; Friedrich, Tobias; Gries, Alina; Hüffner, Falk; Kißig, Otto; Lenzner, Pascal; Molitor, Louise; Schiller, Leon; Wells, Armin; Witheger, Simon
**A Strategic Routing Framework and Algorithms for Computing Alternative Paths**Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1–10:14 - Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna; Molitor, Louise
**Fair Tree Connection Games with Topology-Dependent Edge Cost**Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2020: 15:1–15:15 - Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna
**Flow-Based Network Creation Games**International Joint Conference on Artificial Intelligence (IJCAI) 2020: 139–145 - Bilò, Davide; Bilò, Vittorio; Lenzner, Pascal; Molitor, Louise
**Topological Influence and Locality in Swap Schelling Games**International Symposium on Mathematical Foundations of Computer Science (MFCS) 2020: 15:1–15:15

2019 [ nach oben ]

- Feldotto, Matthias; Lenzner, Pascal; Molitor, Louise; Skopalik, Alexander
**From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation**Autonomous Agents and Multiagent Systems (AAMAS) 2019: 1949–1951 - Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna
**Geometric Network Creation Games**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2019: 323–332 - Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Molitor, Louise; Pappik, Marcus; Schöne, Friedrich; Sommer, Fabian; Stangl, David
**Convergence and Hardness of Strategic Schelling Segregation**Web and Internet Economics (WINE) 2019: 156–170

2018 [ nach oben ]

- Chauhan, Ankit; Lenzner, Pascal; Molitor, Louise
**Schelling Segregation with Strategic Agents**Symposium on Algorithmic Game Theory (SAGT) 2018 - Bilò, Davide; Lenzner, Pascal
**On the Tree Conjecture for the Network Creation Game**Symposium on the Theoretical Aspects of Computer Science (STACS) 2018: 14:1–14:15

2017 [ nach oben ]

- Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Molitor, Louise
**Selfish Network Creation with Non-Uniform Edge Cost**Symposium on Algorithmic Game Theory (SAGT) 2017: 160–172 - Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, David
**Efficient Best Response Computation for Strategic Network Formation under Attack**Symposium on Algorithmic Game Theory (SAGT) 2017: 199–211 - Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, David
**Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2017: 321–323

2016 [ nach oben ]

2015 [ nach oben ]

2014 [ nach oben ]

2013 [ nach oben ]

- Albers, Susanne; Lenzner, Pascal
**On Approximate Nash Equilibria in Network Design**Internet Mathematics 2013: 384–405 - Kawald, Bernd; Lenzner, Pascal
**On dynamics in selfish network creation**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2013: 83–92

2012 [ nach oben ]

2011 [ nach oben ]

- Lenzner, Pascal
**On Dynamics in Basic Network Creation Games**Symposium on Algorithmic Game Theory (SAGT) 2011: 254–265 - Antoniadis, Antonios; Hüffner, Falk; Lenzner, Pascal; Moldenhauer, Carsten; Souza, Alexander
**Balanced Interval Coloring**Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 531–542

2010 [ nach oben ]

## Community Service

Program Committee Memberships: SAGT'16, IJCAI'18, IJCAI'19, AAAI'20, IJCAI'20, AAAI'21, IJCAI'21, SAGT'21, AAAI'22

Scientific Reviewer for various Algorithmic Game Theory (e.g. SAGT, WINE, EC), Algorithms (e.g. SPAA, STACS, ESA, ICALP) and Artificial Intelligence (e.g. IJCAI, AAAI) conferences and journals.

Organizer of the 6th Day on Computational Game Theory

Organizer of WINE 2021 to be held in Potsdam, Germany

## Teaching

I'm proud and grateful to have received the 2017 FRITSE teaching award together with Thomas Bläsius and Timo Kötzing.

**Courses:**

- (Advanced) Competitve Programming, Bachelor/Master-Course, Summer 2021, HPI Potsdam
- Algorithmic Game Theory, Master-Course, Winter 20/21, HPI Potsdam
- Algorithmic Problem Solving, Bachelor-Course, Winter 20/21, HPI Potsdam
- Master Project "Selfish Creation of Efficent Geometric Networks", Summer 2020, HPI Potsdam
- Graph Algorithms, Master-Course, Summer 2020, HPI Potsdam
- (Advanced) Competitive Programming, Bachelor/Master-Course, Summer 2020, HPI Potsdam
- Bachelor Project "Computing Strategic Routes", Winter 19/20, HPI Potsdam
- Algorithmic Problem Solving, Bachelor-Course, Winter 19/20, HPI Potsdam
- (Advanced) Competitive Programming, Bachelor/Master-Course, Summer 2019, HPI Potsdam
- Graph Algorithms, Master-Course, Summer 2019, HPI Potsdam
- Algorithmix, Master-Course, Winter 18/19, HPI Potsdam
- Algorithmic Problem Solving, Bachelor-Course, Winter 18/19, HPI Potsdam
- Seminar on Modern Algorithm Theory, Master-Course, Winter 18/19, HPI Potsdam
- Master Project "Exploring Game-theoretic Schelling Segregation", Winter 18/19, HPI Potsdam
- Introduction to the Mathematics of Algorithms, openHPI MOOC, Summer 2018, HPI Potsdam
- (Advanced) Competitive Programming, Bachelor/Master-Course, Summer 2018, HPI Potsdam
- Graph Algorithms, Master-Course, Summer 2018, HPI Potsdam
- Seminar on Network Science, Master-Course, Summer 2018, HPI Potsdam
- Algorithmix, Master-Course, Winter 17/18, HPI Potsdam
- (Advanced) Algorithmic Problem Solving, Bachelor/Master-Course, Winter 17/18, HPI Potsdam
- Introduction to the Mathematics of Algorithms, openHPI MOOC, Summer 2017, HPI Potsdam
- Seminar on Algorithmic Game Theory, Master-Course, Summer 2017, HPI Potsdam
- (Advanced) Competitive Progamming, Bachelor/Master-Course, Summer 2017, HPI Potsdam
- Graph Algorithms, Master-Course, Summer 2017, HPI Potsdam
- Algorithmix, Master-Course, Winter 16/17, HPI Potsdam
- (Advanced) Algorithmic Problem Solving, Bachelor/Master-Course, Winter 16/17, HPI Potsdam
- Master Project "Strategic Network Formation under Attack", Summer 2016, HPI Potsdam
- (Advanced) Competitive Programming, Bachelor/Master-Course, Summer 2016, HPI Potsdam
- Graph Algorithms, Master-Course, Summer 2016, HPI Potsdam
- Introduction to Algorithms, Bachelor-Course, Winter 2015/16, HPI Potsdam
- Algorithmic Foundations, Bachelor-Course, Summer 2015, FSUJena
- Discrete Modeling, Bachelor-Course, Winter 2014/15, FSUJena

### Teaching (as TA)

*Algorithms & Data Structures*, Summer 2014, HU Berlin*Introduction to Theoretical Computer Science*, Winter 2013/14, HU Berlin*Algorithms & Data Structures*, Summer 2013, HU Berlin*Introduction to Theoretical Computer Science*, Winter 2012/13, HU Berlin*Algorithms & Data Structures*, Summer 2012, HU Berlin*Seminar on Algorithmic Game Theory*, Winter 2011/12, HU Berlin*Algorithms & Data Structures*, Summer 2011, HU Berlin*Seminar on Algorithmic Game Theory*, Winter 2010/11, HU Berlin*Seminar: Perlen der theoretischen Informatik*, Summer 2010, HU Berlin*Seminar on Energy Efficient Algorithms*, Summer 2010, HU Berlin*Introduction to Theoretical Computer Science*, Winter 2009/10, HU Berlin*Theoretical Computer Science*, Winter 2008/09, ETH Zürich*Discrete Mathematics & Logic I*, Winter 2006/07, FSU Jena*Discrete Mathematics & Logic II*, Summer 2006, FSU Jena*Discrete Mathematics & Logic I*, Winter 2005/06, FSU Jena