Guido Schäfer

119 papers A* 13A 14B 17C 3Journal 55Unranked 12

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