Guido Schäfer

From MaRDI portal
Person:681873

Available identifiers

zbMath Open schafer.guidoMaRDI QIDQ681873

List of research outcomes

PublicationDate of PublicationType
Greater flexibility in mechanism design through altruism2023-07-28Paper
Budget feasible mechanisms for procurement auctions with divisible agents2023-07-28Paper
https://portal.mardi4nfdi.de/entity/Q58755742023-02-03Paper
The traveling \(k\)-median problem: approximating optimal network coverage2022-10-19Paper
Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online2022-09-26Paper
https://portal.mardi4nfdi.de/entity/Q50757562022-05-11Paper
Maximum coverage with cluster constraints: an LP-based approximation technique2022-03-22Paper
Computation and efficiency of potential function minimizers of combinatorial congestion games2021-10-20Paper
Topological price of anarchy bounds for clustering games on networks2020-06-30Paper
The median routing problem for simultaneous planning of emergency response and non-emergency jobs2020-05-27Paper
The impact of worst-case deviations in non-atomic network routing games2019-03-21Paper
Tight inefficiency bounds for perception-parameterized affine congestion games2018-12-04Paper
https://portal.mardi4nfdi.de/entity/Q46086132018-03-21Paper
Path deviations outperform approximate stability in heterogeneous congestion games2018-02-13Paper
Coordination games on graphs2017-11-10Paper
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games2017-07-21Paper
https://portal.mardi4nfdi.de/entity/Q29655062017-03-03Paper
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games2016-09-29Paper
The strong price of anarchy of linear bottleneck congestion games2016-01-28Paper
Inefficiency of games with social context2016-01-13Paper
Efficient Equilibria in Polymatrix Coordination Games2015-09-16Paper
Efficient cost-sharing mechanisms for prize-collecting problems2015-08-31Paper
Mechanisms for Hiring a Matroid Base without Money2015-01-14Paper
Bounding the Inefficiency of Altruism through Social Contribution Games2015-01-12Paper
Coordination Games on Graphs (Extended Abstract)2015-01-07Paper
https://portal.mardi4nfdi.de/entity/Q29347102014-12-18Paper
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q29217192014-10-13Paper
Inefficiency of Games with Social Context2013-10-23Paper
Inefficiency of Standard Multi-unit Auctions2013-09-17Paper
Selfishness Level of Strategic Games2013-03-13Paper
https://portal.mardi4nfdi.de/entity/Q29172682012-09-28Paper
Finding Social Optima in Congestion Games with Positive Externalities2012-09-25Paper
Efficiency of Restricted Tolls in Non-atomic Network Routing Games2011-10-28Paper
Budgeted matching and budgeted matroid intersection via the gasoline puzzle2011-06-17Paper
Stackelberg Routing in Arbitrary Networks2011-04-27Paper
Strict Cost Sharing Schemes for Steiner Forest2011-04-04Paper
On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games2010-10-19Paper
Connected facility location via random facility sampling and core detouring2010-10-07Paper
https://portal.mardi4nfdi.de/entity/Q35794592010-08-06Paper
Online Cooperative Cost Sharing2010-05-28Paper
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game2008-10-28Paper
Solutions to Real-World Instances of PSPACE-Complete Stacking2008-09-25Paper
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems2008-07-31Paper
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle2008-06-10Paper
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm2008-05-27Paper
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems2008-05-02Paper
STACS 20042007-10-01Paper
STACS 20042007-10-01Paper
Cost Sharing Methods for Makespan and Completion Time Scheduling2007-09-03Paper
Matching algorithms are fast in sparse random graphs2006-10-25Paper
Automata, Languages and Programming2006-01-10Paper
Topology matters: smoothed competitiveness of metrical task systems2005-09-22Paper
Implementation of O ( nm log n ) weighted matchings in general graphs2005-08-04Paper
Cross-monotonic cost sharing methods for connected facility location games2005-01-11Paper
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47967072003-04-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Guido Schäfer