activity
20172026
most citedTopological Price of Anarchy Bounds for Clustering Games on Networks

1 citations · 2 across the 6 of their papers we have counts for

collaborators

7 papers

cs.GT2026

Tight Liquid Welfare Guarantees for Auctions with Budgets via LP Duality

Twan Kroll, Guido Schäfer, Artem Tsikiridis

We study the efficiency of auctions with budget-constrained bidders and derive tight price of anarchy (PoA) bounds for coarse correlated equilibria (CCE). To this end, we develop a…

cs.GT2025

Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets

Riccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll +3

Online advertising systems have recently transitioned to autobidding, allowing advertisers to delegate bidding decisions to automated agents. Each advertiser directs their agent to…

cs.GT2025

The Effectiveness of Golden Tickets and Wooden Spoons for Budget-Feasible Mechanisms

Bart de Keijzer, Guido Schäfer, Artem Tsikiridis +1

One of the main challenges in mechanism design is to carefully engineer incentives ensuring truthfulness while maintaining strong social welfare approximation guarantees. But these…

cs.GT2024★ 1 cited

To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model

Riccardo Colini-Baldeschi, Sophie Klumper, Guido Schäfer +1

The realm of algorithms with predictions has led to the development of several new algorithms that leverage (potentially erroneous) predictions to enhance their performance guarant…

cs.GT2022

Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents

Sophie Klumper, Guido Schäfer

We consider budget feasible mechanisms for procurement auctions with additive valuation functions. For the divisible case, where agents can be allocated fractionally, there exists…

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…