Guido Schäfer

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 48

Top Venues

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Willem Feijen, Guido Schäfer, Koen Dekker, Seppo Pieterse
Learning-Enhanced Neighborhood Selection for the Vehicle Routing Problem with Time Windows. CoRR (2024)
Riccardo Colini-Baldeschi, Sophie Klumper, Guido Schäfer, Artem Tsikiridis
To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model. CoRR (2024)
Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. WINE (2023)
Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. CoRR (2023)
Danish Kashaev, Guido Schäfer
Round and Bipartize for Vertex Cover Approximation. APPROX/RANDOM (2023)
Georgios Amanatidis, Pieter Kleer, Guido Schäfer
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online. Math. Oper. Res. 47 (3) (2022)
Andries van Beek, Ruben Brokkelkamp, Guido Schäfer
Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions. AAMAS (2022)
Dylan Huizing, Rob van der Mei, Guido Schäfer, Sandjai Bhulai
The enriched median routing problem and its usefulness in practice. Comput. Ind. Eng. 168 (2022)
Ruben Brokkelkamp, Sjir Hoeijmakers, Guido Schäfer
Greater Flexibility in Mechanism Design Through Altruism. SAGT (2022)
Sophie Klumper, Guido Schäfer
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. CoRR (2022)
Danish Kashaev, Guido Schäfer
A Round and Bipartize Approximation Algorithm for Vertex Cover. CoRR (2022)
Sophie Klumper, Guido Schäfer
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. SAGT (2022)
Georgios Birmpas, Evangelos Markakis, Guido Schäfer
Cost Sharing over Combinatorial Domains. ACM Trans. Economics and Comput. 10 (1) (2022)
Willem Feijen, Guido Schäfer
Using Machine Learning Predictions to Speed-up Dijkstra's Shortest Path Algorithm. CoRR (2021)
Andries van Beek, Ruben Brokkelkamp, Guido Schäfer
Capturing Corruption with Hybrid Auctions: Social Welfare Loss in Multi-Unit Auctions. CoRR (2021)
Dylan Huizing, Guido Schäfer
The Traveling k-Median Problem: Approximating Optimal Network Coverage. WAOA (2021)
Pieter Kleer, Guido Schäfer
Computation and efficiency of potential function minimizers of combinatorial congestion games. Math. Program. 190 (1) (2021)
Pieter Kleer, Guido Schäfer
Topological Price of Anarchy Bounds for Clustering Games on Networks. CoRR (2020)
Guido Schäfer, Bernard G. Zweers
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. WAOA (2020)
Guido Schäfer, Bernard G. Zweers
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. CoRR (2020)
Dylan Huizing, Guido Schäfer, Rob D. van der Mei, Sandjai Bhulai
The median routing problem for simultaneous planning of emergency response and non-emergency jobs. Eur. J. Oper. Res. 285 (2) (2020)
Georgios Amanatidis, Pieter Kleer, Guido Schäfer
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. CoRR (2019)
Pieter Kleer, Guido Schäfer
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. Theory Comput. Syst. 63 (1) (2019)
Georgios Amanatidis, Pieter Kleer, Guido Schäfer
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. EC (2019)
Georgios Birmpas, Evangelos Markakis, Guido Schäfer
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond. CoRR (2019)
Georgios Birmpas, Evangelos Markakis, Guido Schäfer
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond. ESA (2019)
Pieter Kleer, Guido Schäfer
Tight inefficiency bounds for perception-parameterized affine congestion games. Theor. Comput. Sci. 754 (2019)
Ruben Brokkelkamp, Sven C. Polak, Guido Schäfer, Yllka Velaj
Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. ISAAC (2019)
Pieter Kleer, Guido Schäfer
Topological Price of Anarchy Bounds for Clustering Games on Networks. WINE (2019)
Félix Carvalho Rodrigues, Eduardo C. Xavier, Guido Schäfer
On Fair Cost Facility Location Games with Non-singleton Players. CLEI Selected Papers (2018)
Félix Carvalho Rodrigues, Guido Schäfer, Eduardo C. Xavier
On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games. ICTCS (2018)
Carla Groenland, Guido Schäfer
The Curse of Ties in Congestion Games with Limited Lookahead. CoRR (2018)
Carla Groenland, Guido Schäfer
The Curse of Ties in Congestion Games with Limited Lookahead. AAMAS (2018)
Pieter Kleer, Guido Schäfer
Path deviations outperform approximate stability in heterogeneous congestion games. CoRR (2017)
Pieter Kleer, Guido Schäfer
Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games. SAGT (2017)
Pieter Kleer, Guido Schäfer
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. CIAC (2017)
Pieter Kleer, Guido Schäfer
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. CoRR (2017)
Pieter Kleer, Guido Schäfer
Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation. EC (2017)
Krzysztof R. Apt, Bart de Keijzer, Mona Rahn, Guido Schäfer, Sunil Simon
Coordination games on graphs. Int. J. Game Theory 46 (3) (2017)
Pieter Kleer, Guido Schäfer
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. SAGT (2016)
Pieter Kleer, Guido Schäfer
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. CoRR (2016)
Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer
The Ground-Set-Cost Budgeted Maximum Coverage Problem. MFCS (2016)
Krzysztof R. Apt, Mona Rahn, Guido Schäfer, Sunil Simon
Coordination Games on Graphs. CoRR (2015)
A. Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. 152 (1-2) (2015)
Bart de Keijzer, Guido Schäfer, Orestis Telelis
The Strong Price of Anarchy of Linear Bottleneck Congestion Games. Theory Comput. Syst. 57 (2) (2015)
Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schäfer
Inefficiency of Games with Social Context. Theory Comput. Syst. 57 (3) (2015)
Mona Rahn, Guido Schäfer
Efficient Equilibria in Polymatrix Coordination Games. MFCS (2) (2015)
Mona Rahn, Guido Schäfer
Efficient Equilibria in Polymatrix Coordination Games. CoRR (2015)
Krzysztof R. Apt, Guido Schäfer
Selfishness Level of Strategic Games. J. Artif. Intell. Res. 49 (2014)
Emmanouil Pountourakis, Guido Schäfer
Mechanisms for Hiring a Matroid Base without Money. SAGT (2014)
Tomas Jelinek, Marcus Klaas, Guido Schäfer
Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. STACS (2014)
Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer
Altruism and Its Impact on the Price of Anarchy. ACM Trans. Economics and Comput. 2 (4) (2014)
Krzysztof R. Apt, Mona Rahn, Guido Schäfer, Sunil Simon
Coordination Games on Graphs (Extended Abstract). WINE (2014)
Aris Anagnostopoulos, Luca Becchetti, Bart de Keijzer, Guido Schäfer
Inefficiency of Games with Social Context. SAGT (2013)
Mona Rahn, Guido Schäfer
Bounding the Inefficiency of Altruism Through Social Contribution Games. CoRR (2013)
Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis
Inefficiency of Standard Multi-unit Auctions. ESA (2013)
Mona Rahn, Guido Schäfer
Bounding the Inefficiency of Altruism through Social Contribution Games. WINE (2013)
Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis
On the Inefficiency of Standard Multi-Unit Auctions CoRR (2013)
Krzysztof R. Apt, Guido Schäfer
Selfishness Level of Strategic Games. SAGT (2012)
Bart de Keijzer, Guido Schäfer
Finding Social Optima in Congestion Games with Positive Externalities. ESA (2012)
Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer
The Robust Price of Anarchy of Altruistic Games. WINE (2011)
Krzysztof R. Apt, Guido Schäfer
Selfishness Level of Strategic Games CoRR (2011)
Vincenzo Bonifaci, Mahyar Salek, Guido Schäfer
Efficiency of Restricted Tolls in Non-atomic Network Routing Games. SAGT (2011)
André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128 (1-2) (2011)
Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer
The Robust Price of Anarchy of Altruistic Games CoRR (2011)
Luciana S. Buriol, Marcus Ritt, Félix Carvalho Rodrigues, Guido Schäfer
On the Smoothed Price of Anarchy of the Traffic Assignment Problem. ATMOS (2011)
Vincenzo Bonifaci, Tobias Harks, Guido Schäfer
Stackelberg Routing in Arbitrary Networks. Math. Oper. Res. 35 (2) (2010)
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer
Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76 (8) (2010)
Janina A. Brenner, Guido Schäfer
Online Cooperative Cost Sharing. CIAC (2010)
Bart de Keijzer, Guido Schäfer, Orestis Telelis
On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. SAGT (2010)
Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39 (8) (2010)
Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37 (5) (2008)
Vincenzo Bonifaci, Tobias Harks, Guido Schäfer
Stackelberg Routing in Arbitrary Networks. WINE (2008)
Janina A. Brenner, Guido Schäfer
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems. SAGT (2008)
André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO (2008)
Janina A. Brenner, Guido Schäfer
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems. Theor. Comput. Sci. 401 (1-3) (2008)
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer
Approximating connected facility location problems via random facility sampling and core detouring. SODA (2008)
Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA (2007)
Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke
Solutions to Real-World Instances of PSPACE-Complete Stacking. ESA (2007)
Janina A. Brenner, Guido Schäfer
Cost Sharing Methods for Makespan and Completion Time Scheduling. STACS (2007)
Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC (2006)
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Math. Oper. Res. 31 (1) (2006)
Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39 (1) (2006)
Guido Schäfer, Naveen Sivadasan
Topology matters: Smoothed competitiveness of metrical task systems. Theor. Comput. Sci. 341 (1-3) (2005)
Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP (2005)
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Algorithms for Optimization with Incomplete Information (2005)
Guido Schäfer, Naveen Sivadasan
Topology Matters: Smoothed Competitiveness of Metrical Task Systems. Algorithms for Optimization with Incomplete Information (2005)
Jochen Könemann, Stefano Leonardi, Guido Schäfer
A group-strategyproof mechanism for Steiner forests. SODA (2005)
Stefano Leonardi, Guido Schäfer
Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326 (1-3) (2004)
Guido Schäfer, Naveen Sivadasan
Topology Matters: Smoothed Competitiveness of Metrical Task Systems. STACS (2004)
Stefano Leonardi, Guido Schäfer
Cross-monotonic cost-sharing methods for connected facility location games. EC (2004)
Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
Matching Algorithms Are Fast in Sparse Random Graphs. STACS (2004)
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer
Scheduling to Minimize Flow Time Metrics. IPDPS (2003)
Hannah Bast, Kurt Mehlhorn, Guido Schäfer
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36 (1) (2003)
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS (2003)
Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan
All-pairs shortest-paths computation in the presence of negative cycles. Inf. Process. Lett. 81 (6) (2002)
Kurt Mehlhorn, Guido Schäfer
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. ACM J. Exp. Algorithmics 7 (2002)
Kurt Mehlhorn, Guido Schäfer
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ESA (2001)
Kurt Mehlhorn, Guido Schäfer
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. WAE (2000)
Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis
An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA (1998)

Guido Schäfer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guido Schäfer