Guido Schäfer

According to our database1, Guido Schäfer authored at least 59 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
On Fair Cost Facility Location Games with Non-singleton Players.
Electr. Notes Theor. Comput. Sci., 2019

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

The Curse of Ties in Congestion Games with Limited Lookahead.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Coordination games on graphs.
Int. J. Game Theory, 2017

Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Steiner Forest.
Encyclopedia of Algorithms, 2016

The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

The Ground-Set-Cost Budgeted Maximum Coverage Problem.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
The Strong Price of Anarchy of Linear Bottleneck Congestion Games.
Theory Comput. Syst., 2015

Efficient cost-sharing mechanisms for prize-collecting problems.
Math. Program., 2015

Efficient Equilibria in Polymatrix Coordination Games.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Budgeted Matching via the Gasoline Puzzle.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
Altruism and Its Impact on the Price of Anarchy.
ACM Trans. Economics and Comput., 2014

Coordination Games on Graphs (Extended Abstract).
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Mechanisms for Hiring a Matroid Base without Money.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013
Bounding the Inefficiency of Altruism through Social Contribution Games.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Inefficiency of Games with Social Context.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Inefficiency of Standard Multi-unit Auctions.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Selfishness Level of Strategic Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Finding Social Optima in Congestion Games with Positive Externalities.
Proceedings of the Algorithms - ESA 2012, 2012

2011
The Robust Price of Anarchy of Altruistic Games.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Efficiency of Restricted Tolls in Non-atomic Network Routing Games.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

On the Smoothed Price of Anarchy of the Traffic Assignment Problem.
Proceedings of the ATMOS 2011, 2011

2010
Strict Cost Sharing Schemes for Steiner Forest.
SIAM J. Comput., 2010

Connected facility location via random facility sampling and core detouring.
J. Comput. Syst. Sci., 2010

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Online Cooperative Cost Sharing.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2008
Steiner Forest.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems.
Theor. Comput. Sci., 2008

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game.
SIAM J. Comput., 2008

Stackelberg Routing in Arbitrary Networks.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximating connected facility location problems via random facility sampling and core detouring.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007
Cost Sharing Methods for Makespan and Completion Time Scheduling.
Proceedings of the STACS 2007, 2007

An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Solutions to Real-World Instances of PSPACE-Complete Stacking.
Proceedings of the Algorithms, 2007

2006
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm.
Math. Oper. Res., 2006

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
A group-strategyproof mechanism for Steiner forests.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Topology Matters: Smoothed Competitiveness of Metrical Task Systems.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Worst case instances are fragile: average case and smoothed competitive analysis of algorithms.
PhD thesis, 2004

Topology Matters: Smoothed Competitiveness of Metrical Task Systems.
Proceedings of the STACS 2004, 2004

Matching Algorithms Are Fast in Sparse Random Graphs.
Proceedings of the STACS 2004, 2004

Cross-monotonic cost-sharing methods for connected facility location games.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

2003
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.
Algorithmica, 2003

Scheduling to Minimize Flow Time Metrics.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures.
ACM Journal of Experimental Algorithmics, 2002

All-pairs shortest-paths computation in the presence of negative cycles.
Inf. Process. Lett., 2002

2001
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.
Proceedings of the Algorithms, 2001

2000
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures.
Proceedings of the Algorithm Engineering, 2000

1998
An Experimental Study of Dynamic Algorithms for Directed Graphs.
Proceedings of the Algorithms, 1998


  Loading...