11 citations · 35 across the 23 of their papers we have counts for
25 papers
An Entropy Potential for Type-Composition Games
Morteza Alimi, Merlin de la Haye, Pascal Lenzner +3
Potential functions are a key tool in theoretical computer science with applications ranging from the runtime analysis of algorithms and data structures, through the analysis of th…
Selfish routing games with priority lanes
Yang Li, Alexander Skopalik, Marc Uetz
We study selfish routing games where users can choose between regular and priority service for each network edge on their chosen path. Priority users pay an additional fee, but in…
The Bakers and Millers Game with Restricted Locations
Simon Krogmann, Pascal Lenzner, Alexander Skopalik
We study strategic location choice by customers and sellers, termed the Bakers and Millers Game in the literature. In our generalized setting, each miller can freely choose any loc…
Equilibria in Two-Stage Facility Location with Atomic Clients
Simon Krogmann, Pascal Lenzner, Alexander Skopalik +2
We consider competitive facility location as a two-stage multi-agent system with two types of clients. For a given host graph with weighted clients on the vertices, first facility…
Strategic Resource Selection with Homophilic Agents
Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner +1
The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, ag…
Strategic Facility Location with Clients that Minimize Total Waiting Time
Simon Krogmann, Pascal Lenzner, Alexander Skopalik
We study a non-cooperative two-sided facility location game in which facilities and clients behave strategically. This is in contrast to many other facility location games in which…