1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.GT2020★ 1 cited
Topological Price of Anarchy Bounds for Clustering Games on Networks
Pieter Kleer, Guido Schäfer
We consider clustering games in which the players are embedded in a network and want to coordinate (or anti-coordinate) their strategy with their neighbors. The goal of a player is…
cs.GT2017
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games
Pieter Kleer, Guido Schäfer
Congestion games constitute an important class of non-cooperative games which was introduced by Rosenthal in 1973. In recent years, several extensions of these games were proposed…