Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

Dr. Pascal Lenzner

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

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

Publications

[ 2021 ] [ 2020 ] [ 2019 ] [ 2018 ] [ 2017 ] [ 2016 ] [ 2015 ] [ 2014 ] [ 2013 ] [ 2012 ] [ 2011 ] [ 2010 ]

2021 [ nach oben ]

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

2020 [ nach oben ]

  • On the Tree Conjecture fo... - Download
    Bilò, Davide; Lenzner, Pascal On the Tree Conjecture for the Network Creation GameTheory of Computing Systems 2020: 422–443
     
  • A Strategic Routing Frame... - Download
    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 PathsAlgorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1–10:14
     
  • Fair Tree Connection Game... - Download
    Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna; Molitor, Louise Fair Tree Connection Games with Topology-Dependent Edge CostFoundations of Software Technology and Theoretical Computer Science (FSTTCS) 2020: 15:1–15:15
     
  • Flow-Based Network Creati... - Download
    Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna Flow-Based Network Creation GamesInternational Joint Conference on Artificial Intelligence (IJCAI) 2020: 139–145
     
  • Topological Influence and... - Download
    Bilò, Davide; Bilò, Vittorio; Lenzner, Pascal; Molitor, Louise Topological Influence and Locality in Swap Schelling GamesInternational Symposium on Mathematical Foundations of Computer Science (MFCS) 2020: 15:1–15:15
     

2019 [ nach oben ]

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

2018 [ nach oben ]

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

2017 [ nach oben ]

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

2016 [ nach oben ]

  • On Selfish Creation of Ro... - Download
    Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Münn, Martin On Selfish Creation of Robust NetworksSymposium on Algorithmic Game Theory (SAGT) 2016: 141–152
     

2015 [ nach oben ]

  • Network Creation Games: T... - Download
    Cord-Landwehr, Andreas; Lenzner, Pascal Network Creation Games: Think Global - Act LocalMathematical Foundations of Computer Science (MFCS) 2015: 248–260
     

2014 [ nach oben ]

  • On selfish network creati... - Download
    Lenzner, Pascal On selfish network creationDoctoral Dissertation, Humboldt University of Berlin 2014
     

2013 [ nach oben ]

  • On Approximate Nash Equil... - Download
    Albers, Susanne; Lenzner, Pascal On Approximate Nash Equilibria in Network DesignInternet Mathematics 2013: 384–405
     
  • On dynamics in selfish ne... - Download
    Kawald, Bernd; Lenzner, Pascal On dynamics in selfish network creationSymposium on Parallelism in Algorithms and Architectures (SPAA) 2013: 83–92
     

2012 [ nach oben ]

  • Greedy Selfish Network Cr... - Download
    Lenzner, Pascal Greedy Selfish Network CreationWeb and Internet Economics (WINE) 2012: 142–155
     

2011 [ nach oben ]

  • On Dynamics in Basic Netw... - Download
    Lenzner, Pascal On Dynamics in Basic Network Creation GamesSymposium on Algorithmic Game Theory (SAGT) 2011: 254–265
     
  • Balanced Interval Colorin... - Download
    Antoniadis, Antonios; Hüffner, Falk; Lenzner, Pascal; Moldenhauer, Carsten; Souza, Alexander Balanced Interval ColoringSymposium on Theoretical Aspects of Computer Science (STACS) 2011: 531–542
     

2010 [ nach oben ]

  • On Approximate Nash Equil... - Download
    Albers, Susanne; Lenzner, Pascal On Approximate Nash Equilibria in Network DesignWeb and Internet Economics (WINE) 2010: 14–25
     

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:

Teaching (as TA)