default search action
Guido Schäfer
Person information
- affiliation: Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
- affiliation (former): Technical University of Berlin, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c53]Adrian Haret
, Sophie Klumper
Committees and Equilibria: Multiwinner Approval Voting Through the Lens of Budgeting Games. EC 2024: 51-70 - [c52]Riccardo Colini-Baldeschi
To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model. EC 2024: 1134-1154 - [e2]Guido Schäfer
Algorithmic Game Theory - 17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3-6, 2024, Proceedings. Lecture Notes in Computer Science 15156, Springer 2024, ISBN 978-3-031-71032-2 [contents] - [i23]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 abs/2403.03725 (2024) - [i22]Willem Feijen, Guido Schäfer, Koen Dekker, Seppo Pieterse:
Learning-Enhanced Neighborhood Selection for the Vehicle Routing Problem with Time Windows. CoRR abs/2403.08839 (2024) - 2023
- [c51]Danish Kashaev, Guido Schäfer
Round and Bipartize for Vertex Cover Approximation. APPROX/RANDOM 2023: 20:1-20:20 - [c50]Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. WINE 2023: 41-58 - [i21]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 abs/2307.07385 (2023) - 2022
- [j26]Dylan Huizing, Rob van der Mei, Guido Schäfer
The enriched median routing problem and its usefulness in practice. Comput. Ind. Eng. 168: 108063 (2022) - [j25]Georgios Amanatidis
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online. Math. Oper. Res. 47(3): 2286-2309 (2022) - [j24]Georgios Birmpas
Cost Sharing over Combinatorial Domains. ACM Trans. Economics and Comput. 10(1): 4:1-4:26 (2022) - [c49]Andries van Beek, Ruben Brokkelkamp, Guido Schäfer:
Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions. AAMAS 2022: 1283-1291 - [c48]Ruben Brokkelkamp
Greater Flexibility in Mechanism Design Through Altruism. SAGT 2022: 41-59 - [c47]Sophie Klumper
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. SAGT 2022: 78-93 - [i20]Sophie Klumper, Guido Schäfer:
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. CoRR abs/2206.13124 (2022) - [i19]Danish Kashaev, Guido Schäfer
A Round and Bipartize Approximation Algorithm for Vertex Cover. CoRR abs/2211.01699 (2022) - 2021
- [j23]Pieter Kleer
Computation and efficiency of potential function minimizers of combinatorial congestion games. Math. Program. 190(1): 523-560 (2021) - [c46]Dylan Huizing
The Traveling k-Median Problem: Approximating Optimal Network Coverage. WAOA 2021: 80-98 - [i18]Andries van Beek, Ruben Brokkelkamp, Guido Schäfer:
Capturing Corruption with Hybrid Auctions: Social Welfare Loss in Multi-Unit Auctions. CoRR abs/2106.01822 (2021) - [i17]Willem Feijen, Guido Schäfer:
Using Machine Learning Predictions to Speed-up Dijkstra's Shortest Path Algorithm. CoRR abs/2112.11927 (2021) - 2020
- [j22]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): 712-727 (2020) - [c45]Guido Schäfer
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. WAOA 2020: 63-80 - [i16]Pieter Kleer, Guido Schäfer:
Topological Price of Anarchy Bounds for Clustering Games on Networks. CoRR abs/2011.09717 (2020) - [i15]Guido Schäfer, Bernard G. Zweers:
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. CoRR abs/2012.04420 (2020)
2010 – 2019
- 2019
- [j21]Pieter Kleer
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. Theory Comput. Syst. 63(1): 54-89 (2019) - [j20]Pieter Kleer
Tight inefficiency bounds for perception-parameterized affine congestion games. Theor. Comput. Sci. 754: 65-87 (2019) - [c44]Georgios Amanatidis
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. EC 2019: 901-919 - [c43]Georgios Birmpas, Evangelos Markakis, Guido Schäfer:
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond. ESA 2019: 20:1-20:17 - [c42]Ruben Brokkelkamp
Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. ISAAC 2019: 13:1-13:15 - [c41]Pieter Kleer
Topological Price of Anarchy Bounds for Clustering Games on Networks. WINE 2019: 241-255 - [i14]Georgios Amanatidis, Pieter Kleer, Guido Schäfer:
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. CoRR abs/1905.00848 (2019) - [i13]Georgios Birmpas, Evangelos Markakis, Guido Schäfer:
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond. CoRR abs/1910.06384 (2019) - 2018
- [c40]Carla Groenland, Guido Schäfer:
The Curse of Ties in Congestion Games with Limited Lookahead. AAMAS 2018: 1941-1943 - [c39]Félix Carvalho Rodrigues, Guido Schäfer, Eduardo C. Xavier:
On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games. ICTCS 2018: 36-47 - [c38]Félix Carvalho Rodrigues
On Fair Cost Facility Location Games with Non-singleton Players. CLEI Selected Papers 2018: 21-38 - [i12]Carla Groenland, Guido Schäfer:
The Curse of Ties in Congestion Games with Limited Lookahead. CoRR abs/1804.07107 (2018) - 2017
- [j19]Krzysztof R. Apt, Bart de Keijzer, Mona Rahn, Guido Schäfer, Sunil Simon:
Coordination games on graphs. Int. J. Game Theory 46(3): 851-877 (2017) - [c37]Pieter Kleer, Guido Schäfer:
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. CIAC 2017: 381-392 - [c36]Pieter Kleer, Guido Schäfer:
Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games. SAGT 2017: 212-224 - [c35]Pieter Kleer, Guido Schäfer:
Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation. EC 2017: 223-240 - [i11]Pieter Kleer, Guido Schäfer:
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. CoRR abs/1701.07614 (2017) - [i10]Pieter Kleer, Guido Schäfer:
Path deviations outperform approximate stability in heterogeneous congestion games. CoRR abs/1707.01278 (2017) - 2016
- [c34]Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer:
The Ground-Set-Cost Budgeted Maximum Coverage Problem. MFCS 2016: 50:1-50:13 - [c33]Pieter Kleer, Guido Schäfer:
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. SAGT 2016: 129-140 - [r2]Guido Schäfer:
Steiner Forest. Encyclopedia of Algorithms 2016: 2099-2102 - [i9]Pieter Kleer, Guido Schäfer:
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. CoRR abs/1605.01510 (2016) - 2015
- [j18]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. 152(1-2): 147-188 (2015) - [j17]Bart de Keijzer, Guido Schäfer, Orestis Telelis:
The Strong Price of Anarchy of Linear Bottleneck Congestion Games. Theory Comput. Syst. 57(2): 377-396 (2015) - [j16]Aris Anagnostopoulos
Inefficiency of Games with Social Context. Theory Comput. Syst. 57(3): 782-804 (2015) - [c32]Mona Rahn, Guido Schäfer:
Efficient Equilibria in Polymatrix Coordination Games. MFCS (2) 2015: 529-541 - [p1]Guido Schäfer:
Budgeted Matching via the Gasoline Puzzle. Gems of Combinatorial Optimization and Graph Algorithms 2015: 49-57 - [e1]Evangelos Markakis, Guido Schäfer:
Web and Internet Economics - 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings. Lecture Notes in Computer Science 9470, Springer 2015, ISBN 978-3-662-48994-9 [contents] - [i8]Krzysztof R. Apt, Mona Rahn, Guido Schäfer, Sunil Simon:
Coordination Games on Graphs. CoRR abs/1501.07388 (2015) - [i7]Mona Rahn, Guido Schäfer:
Efficient Equilibria in Polymatrix Coordination Games. CoRR abs/1504.07518 (2015) - 2014
- [j15]Krzysztof R. Apt, Guido Schäfer:
Selfishness Level of Strategic Games. J. Artif. Intell. Res. 49: 207-240 (2014) - [j14]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): 17:1-17:45 (2014) - [c31]Emmanouil Pountourakis, Guido Schäfer:
Mechanisms for Hiring a Matroid Base without Money. SAGT 2014: 255-266 - [c30]Tomas Jelinek, Marcus Klaas, Guido Schäfer:
Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. STACS 2014: 433-444 - [c29]Krzysztof R. Apt, Mona Rahn, Guido Schäfer, Sunil Simon:
Coordination Games on Graphs (Extended Abstract). WINE 2014: 441-446 - 2013
- [c28]Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis:
Inefficiency of Standard Multi-unit Auctions. ESA 2013: 385-396 - [c27]Aris Anagnostopoulos
Inefficiency of Games with Social Context. SAGT 2013: 219-230 - [c26]Mona Rahn, Guido Schäfer:
Bounding the Inefficiency of Altruism through Social Contribution Games. WINE 2013: 391-404 - [i6]Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis:
On the Inefficiency of Standard Multi-Unit Auctions. CoRR abs/1303.1646 (2013) - [i5]Mona Rahn, Guido Schäfer:
Bounding the Inefficiency of Altruism Through Social Contribution Games. CoRR abs/1308.2497 (2013) - 2012
- [c25]Bart de Keijzer, Guido Schäfer:
Finding Social Optima in Congestion Games with Positive Externalities. ESA 2012: 395-406 - [c24]Krzysztof R. Apt, Guido Schäfer:
Selfishness Level of Strategic Games. SAGT 2012: 13-24 - 2011
- [j13]André Berger, Vincenzo Bonifaci
Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128(1-2): 355-372 (2011) - [c23]Luciana S. Buriol, Marcus Ritt
On the Smoothed Price of Anarchy of the Traffic Assignment Problem. ATMOS 2011: 122-133 - [c22]Vincenzo Bonifaci
Efficiency of Restricted Tolls in Non-atomic Network Routing Games. SAGT 2011: 302-313 - [c21]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
The Robust Price of Anarchy of Altruistic Games. WINE 2011: 383-390 - [i4]Krzysztof R. Apt, Guido Schäfer:
Selfishness Level of Strategic Games. CoRR abs/1105.2432 (2011) - [i3]Po-An Chen, Bart de Keijzer, David Kempe, Guido Schäfer:
The Robust Price of Anarchy of Altruistic Games. CoRR abs/1112.3680 (2011) - 2010
- [j12]Friedrich Eisenbrand, Fabrizio Grandoni
Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76(8): 709-726 (2010) - [j11]Vincenzo Bonifaci
Stackelberg Routing in Arbitrary Networks. Math. Oper. Res. 35(2): 330-346 (2010) - [j10]Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer:
Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010) - [c20]Janina A. Brenner, Guido Schäfer:
Online Cooperative Cost Sharing. CIAC 2010: 252-263 - [c19]Bart de Keijzer, Guido Schäfer, Orestis Telelis:
On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. SAGT 2010: 335-346
2000 – 2009
- 2008
- [j9]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): 1319-1341 (2008) - [j8]Janina A. Brenner, Guido Schäfer:
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems. Theor. Comput. Sci. 401(1-3): 96-106 (2008) - [c18]André Berger
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. IPCO 2008: 273-287 - [c17]Janina A. Brenner, Guido Schäfer:
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems. SAGT 2008: 315-326 - [c16]Friedrich Eisenbrand, Fabrizio Grandoni
Approximating connected facility location problems via random facility sampling and core detouring. SODA 2008: 1174-1183 - [c15]Vincenzo Bonifaci
Stackelberg Routing in Arbitrary Networks. WINE 2008: 239-250 - [r1]Guido Schäfer:
Steiner Forest. Encyclopedia of Algorithms 2008 - 2007
- [c14]Felix G. König, Marco E. Lübbecke
Solutions to Real-World Instances of PSPACE-Complete Stacking. ESA 2007: 729-740 - [c13]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: 1153-1162 - [c12]Janina A. Brenner, Guido Schäfer:
Cost Sharing Methods for Makespan and Completion Time Scheduling. STACS 2007: 670-681 - 2006
- [j7]Luca Becchetti
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Math. Oper. Res. 31(1): 85-108 (2006) - [j6]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006) - [c11]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: 663-670 - 2005
- [j5]Guido Schäfer, Naveen Sivadasan:
Topology matters: Smoothed competitiveness of metrical task systems. Theor. Comput. Sci. 341(1-3): 216-246 (2005) - [c10]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: 930-942 - [c9]Jochen Könemann, Stefano Leonardi, Guido Schäfer:
A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619 - [i2]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 - [i1]Guido Schäfer, Naveen Sivadasan:
Topology Matters: Smoothed Competitiveness of Metrical Task Systems. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [b1]Guido Schäfer:
Worst case instances are fragile: average case and smoothed competitive analysis of algorithms. Saarland University, Saarbrücken, Germany, 2004, pp. 1-115 - [j4]Stefano Leonardi, Guido Schäfer:
Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1-3): 431-442 (2004) - [c8]Stefano Leonardi, Guido Schäfer:
Cross-monotonic cost-sharing methods for connected facility location games. EC 2004: 242-243 - [c7]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 - [c6]Guido Schäfer, Naveen Sivadasan:
Topology Matters: Smoothed Competitiveness of Metrical Task Systems. STACS 2004: 489-500 - 2003
- [j3]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): 75-88 (2003) - [c5]Luca Becchetti
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS 2003: 462-471 - [c4]Luca Becchetti
Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223 - 2002
- [j2]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): 341-343 (2002) - [j1]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: 4 (2002) - 2001
- [c3]Kurt Mehlhorn, Guido Schäfer:
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ESA 2001: 242-253 - 2000
- [c2]Kurt Mehlhorn, Guido Schäfer:
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. WAE 2000: 23-38
1990 – 1999
- 1998
- [c1]Daniele Frigioni, Tobias Miller, Umberto Nanni
An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA 1998: 368-380
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: