The following pages link to Guido Schäfer (Q681873):
Displayed 50 items.
- Item:Q681873 (redirect page) (← links)
- Efficient cost-sharing mechanisms for prize-collecting problems (Q494320) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Path deviations outperform approximate stability in heterogeneous congestion games (Q681874) (← links)
- Cross-monotonic cost sharing methods for connected facility location games (Q703566) (← links)
- Topological price of anarchy bounds for clustering games on networks (Q777968) (← links)
- Inefficiency of games with social context (Q904696) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms (Q1402219) (← links)
- Tight inefficiency bounds for perception-parameterized affine congestion games (Q1628591) (← links)
- Coordination games on graphs (Q1677255) (← links)
- The impact of worst-case deviations in non-atomic network routing games (Q1733381) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
- Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
- Matching algorithms are fast in sparse random graphs (Q2432523) (← links)
- Topology matters: smoothed competitiveness of metrical task systems (Q2566010) (← links)
- The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games (Q2819453) (← links)
- Inefficiency of Standard Multi-unit Auctions (Q2849330) (← links)
- Inefficiency of Games with Social Context (Q2856146) (← links)
- Finding Social Optima in Congestion Games with Positive Externalities (Q2912857) (← links)
- (Q2917268) (← links)
- (Q2921719) (← links)
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (Q2931426) (← links)
- (Q2934710) (← links)
- Coordination Games on Graphs (Extended Abstract) (Q2937007) (← links)
- Bounding the Inefficiency of Altruism through Social Contribution Games (Q2937774) (← links)
- Mechanisms for Hiring a Matroid Base without Money (Q2938663) (← links)
- Efficient Equilibria in Polymatrix Coordination Games (Q2946422) (← links)
- (Q2965506) (← links)
- Efficiency of Restricted Tolls in Non-atomic Network Routing Games (Q3095283) (← links)
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
- Stackelberg Routing in Arbitrary Networks (Q3169096) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- Solutions to Real-World Instances of PSPACE-Complete Stacking (Q3527262) (← links)
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game (Q3532565) (← links)
- Online Cooperative Cost Sharing (Q3563007) (← links)
- (Q3579459) (← links)
- Cost Sharing Methods for Makespan and Completion Time Scheduling (Q3590973) (← links)
- (Q4608613) (← links)
- (Q4796707) (← links)
- Selfishness Level of Strategic Games (Q4910928) (← links)
- (Q5075756) (← links)
- Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games (Q5283383) (← links)
- STACS 2004 (Q5309689) (← links)
- STACS 2004 (Q5309725) (← links)
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm (Q5387966) (← links)