3 papers
cs.GT2026
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…
cs.GT2026
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…
cs.GT2025
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…