Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Hardness results for multicast cost sharing
Theoretical Computer Science
Group Strategyproof Mechanisms via Primal-Dual Algorithms
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Mechanism design for online real-time scheduling
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science
Limitations of cross-monotonic cost sharing schemes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A group-strategyproof mechanism for Steiner forests
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
From primal-dual to cost shares and back: a stronger LP relaxation for the steiner forest problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Fast monotone 3-approximation algorithm for scheduling related machines
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fair cost-sharing methods for scheduling jobs on parallel machines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
New efficiency results for makespan cost sharing
Information Processing Letters
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Is Shapley Cost Sharing Optimal?
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A complete characterization of group-strategyproof mechanisms of cost-sharing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The power of two prices: beyond cross-monotonicity
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On budget-balanced group-strategyproof cost-sharing mechanisms
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Cost-recovering bayesian algorithmic mechanism design
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimization problems using this novel efficiency measure, with a particular focus on scheduling problems. While we prove a lower bound of Ω(log n) for a very general class of problems, we give a best possible cost sharing method for minimum makespan scheduling. Finally, we show that no budget balanced cost sharing methods for completion or flow time objectives exist.