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
  • Modeling and analyzing network creation by selfish agents
  • Network Design and algorithmic problems on graphs in general

News

Publications

[ 2018 ] [ 2017 ] [ 2016 ] [ 2015 ] [ 2014 ] [ 2013 ] [ 2012 ] [ 2011 ] [ 2010 ]

2018 [ to top ]

  • Schelling Segregation wit... - Download
    Chauhan, Ankit; Lenzner, Pascal; Molitor, Louise Schelling Segregation with Strategic Agents. Symposium on Algorithmic Game Theory (SAGT) 2018
     
  • On the Tree Conjecture fo... - Download
    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 [ to top ]

  • Selfish Network Creation ... - Download
    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
     
  • 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 Attack. Symposium 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 Attack. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2017: 321-323
     

2016 [ to top ]

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

2015 [ to top ]

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

2014 [ to top ]

  • On selfish network creati... - Download
    Lenzner, Pascal On selfish network creation. 2014
     

2013 [ to top ]

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

2012 [ to top ]

  • Greedy Selfish Network Cr... - Download
    Lenzner, Pascal Greedy Selfish Network Creation. Conference on Web and Internet Economics (WINE) 2012: 142-155
     

2011 [ to top ]

  • On Dynamics in Basic Netw... - Download
    Lenzner, Pascal On Dynamics in Basic Network Creation Games. Symposium 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 Coloring. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 531-542
     

2010 [ to top ]

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

Community Service

Program Committee Memberships: SAGT'16, IJCAI'18

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

Organizer of the 6th Day on Computational Game Theory

Teaching

Teaching (as TA)

Short CV

Education:  

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

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

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

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

 

Positions:

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

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

08/2014 - 09/2014: Researcher in the Algorithms & Complexity Group at Humboldt-University Berlin, Germany

10/2009 -07/2014: PhD Student and Researcher in the Algorithms & Complexity Group at Humboldt-University Berlin, Germany