Pascal Lenzner

Orcid: 0000-0002-3010-1019

Affiliations:
  • Hasso Plattner Institute, Potsdam, Germany
  • Humboldt University of Berlin, Department of Computer Science, Germany


According to our database1, Pascal Lenzner authored at least 42 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Geometric Network Creation Games.
SIAM J. Discret. Math., March, 2024

Strategic Network Creation for Enabling Greedy Routing.
CoRR, 2024

Equilibria in Two-Stage Facility Location with Atomic Clients.
CoRR, 2024

Towards Linear Spanners in All Temporal Cliques.
CoRR, 2024

2023
Social Distancing Network Creation.
Algorithmica, July, 2023

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games.
CoRR, 2023

Single-Peaked Jump Schelling Games.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

The Impact of Cooperation in Bilateral Network Creation.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Strategic Resource Selection with Homophilic Agents.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Temporal Network Creation Games.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Schelling Games with Continuous Types.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Schelling Games with Continuous Types (short paper).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

The Swiss Gambit.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Equilibria and Convergence in Fire Sale Games.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

Strategic Facility Location with Clients That Minimize Total Waiting Time.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Topological influence and locality in swap schelling games.
Auton. Agents Multi Agent Syst., 2022

Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Network Creation with Homophilic Agents.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Asynchronous Opinion Dynamics in Social Networks.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Efficiency and Stability in Euclidean Network Design.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Two-Stage Facility Location Games with Strategic Clients and Facilities.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Selfish Creation of Social Networks.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
On the Tree Conjecture for the Network Creation Game.
Theory Comput. Syst., 2020

Flow-Based Network Creation Games.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Fair Tree Connection Games with Topology-Dependent Edge Cost.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

A Strategic Routing Framework and Algorithms for Computing Alternative Paths.
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019
Convergence and Hardness of Strategic Schelling Segregation.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Schelling Segregation with Strategic Agents.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Efficient Best Response Computation for Strategic Network Formation Under Attack.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Selfish Network Creation with Non-uniform Edge Cost.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
On Selfish Creation of Robust Networks.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015
Network Creation Games: Think Global - Act Local.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
On selfish network creation.
PhD thesis, 2014

2013
On Approximate Nash Equilibria in Network Design.
Internet Math., 2013

On dynamics in selfish network creation.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012
Greedy Selfish Network Creation.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011
Balanced Interval Coloring.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On Dynamics in Basic Network Creation Games.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011


  Loading...